Robustness of \(k\)-gon Voronoi diagram construction

DOI10.1016/j.ipl.2005.10.009zbMath1181.68286OpenAlexW2148934646MaRDI QIDQ1045919

Evanthia Papadopoulou, Zhenming Chen, Jinhui Xu

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.10.009

zbMATH Keywords

Voronoi diagramcomputational geometryalgorithmic degree

Mathematics Subject Classification ID

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

Related Items

A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs ⋮ Robust Point-Location in Generalized Voronoi Diagrams

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards exact geometric computation
• A sweepline algorithm for Voronoi diagrams
• Concrete and abstract Voronoi diagrams
• A compact piecewise-linear Voronoi diagram for convex sites in the plane
• ``The big sweep: On the power of the wavefront approach to Voronoi diagrams
• On Some Distance Problems in Fixed Orientations
• Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
• THE L_∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS