OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS

DOI10.1142/S0218195907002483zbMath1200.65016OpenAlexW2114174667MaRDI QIDQ3503107

Paul Harrington, Colm Ó Dúnlaing, Chee-Keng Yap

Publication date: 20 May 2008

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195907002483

zbMATH Keywords

convex setsVoronoi diagrams

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• A sweepline algorithm for Voronoi diagrams
• Triangulating a simple polygon in linear time
• Concrete and abstract Voronoi diagrams
• An optimal convex hull algorithm in any fixed dimension
• An algorithm for constructing the convex hull of a set of spheres in dimension \(d\)
• The Voronoi diagram of curved objects
• Generalization of Voronoi Diagrams in the Plane
• TRIANGULATING DISJOINT JORDAN CHAINS
• Power Diagrams: Properties, Algorithms and Applications

This page was built for publication: OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS