Geometries is at most 64 machine epsilons (6īits of mantissa, for the IEEE-754 floating-point type), while onĪverage it's slightly lower. The implementation guaranties, that the relative error of the Libraries (more details in the benchmarks). Implementation has a solid performance comparing to the other known Higher precision predicates when appropriate. Produce the correct result always, however the library embeds theĮrror arithmetic apparatus to identify such situations and switch Using the efficient, floating-point based predicates. Overcomes this by avoiding the multiprecision Resolved using the multiprecision geometricĮven for the commercial libraries, usage of such predicates Presence of the new operator in the code. The implementation avoids theįirst type of the issues using pure STL data structures, thus there is Robustness issues can be divided onto the two main categories: memory With direct applications in the computer vision The medial axis transform of the arbitrary set of input geometries, Segments allows to discretize any input geometry (sampledįloating-point coordinates can be scaled and snapped to the integer Handle input data sets that contain linear segments, even considering There are just a few implementations of the Voronoi diagram Library and the main benefits comparing to the other implementations are The second one may be resolved using the Boost.Polygon segment utils. While the first restriction is permanent (itĪllows to give the exact warranties about the output precision and This means that input point should not lie inside the input segment and input segments should not intersect except their endpoints. Input points and segments should not overlap except their endpoints.int64) could be achieved through the configuration of the coordinate type traits ( Voronoi Advanced tutorial). The int32 data type is supported by the default implementation. Coordinates of the input points and endpoints of the input segments should have integral type.The Voronoi extensions of the Boost Polygon library provide functionality toĬonstruct a Voronoi diagram of a set of pointsĪnd linear segments in 2D space with the following set of limitations:
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |