An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane

DOI10.1080/00207169608804499zbMath1001.68583OpenAlexW1990256178MaRDI QIDQ2710773

Jon G. Rokne, Marina L. Gavrilova

Publication date: 19 December 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169608804499

zbMATH Keywords

computational complexitypower diagramVoronoi diagramcomputational geometryDelaunay triangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

EUCLIDEAN VORONOI DIAGRAM FOR CIRCLES IN A CIRCLE ⋮ Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance ⋮ On determining the cover of a simplex by spheres centered at its vertices ⋮ Shapes of Delaunay Simplexes and Structural Analysis of Hard Sphere Packings ⋮ Swap conditions for dynamic Voronoi diagrams for circles and line segments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Order-k Voronoi diagrams of sites with additive weights in the plane
• A sweepline algorithm for Voronoi diagrams
• Voronoi Diagram in the Laguerre Geometry and Its Applications
• Intersection and Closest-Pair Problems for a Set of Planar Discs
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Generalization of Voronoi Diagrams in the Plane
• Convex hulls of finite sets of points in two and three dimensions
• Power Diagrams: Properties, Algorithms and Applications