We provide a complete description of dynamic algorithms for constructing convex hulls and Voronoi diagrams of additively weighted points of ℝd. We present simple algorithms and provide a description of the predicates. The algorithms have been implemented in ℝ3 and experimental results are reported. Our implementation follows the CGAL design and, in particular, is made both robust and efficient through the use of filtered exact arithmetic. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Boissonnat, J. D., & Delage, C. (2005). Convex hull and Voronoi diagram of additively weighted points. In Lecture Notes in Computer Science (Vol. 3669, pp. 367–378). Springer Verlag. https://doi.org/10.1007/11561071_34
Mendeley helps you to discover research relevant for your work.