Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space

DOI10.1007/978-3-642-16007-3_1zbMath1309.68206arXiv0906.2760OpenAlexW3101862536MaRDI QIDQ3052755

Ophir Setter, Micha Sharir, Dan Halperin

Publication date: 2 November 2010

Published in: Transactions on Computational Science IX (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.2760

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Randomized algorithms (68W20)

Related Items (5)

Arrangements on parametric surfaces. I: General framework and infrastructure ⋮ Arrangements on parametric surfaces. II: Concretizations and applications ⋮ The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs ⋮ Computing the topology of Voronoï diagrams of parallel half-lines ⋮ Non-centered Voronoi Skeletons

Uses Software

• CGAL
• RAGlib
• 2D Arrangement
• 3D envelopes
• 2D triangulations
• Traits

This page was built for publication: Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space