PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets

Authors:
Saurabh Sethia;Martin Held;Joseph S. B. Mitchell
Affiliations:
-;-;-
Venue:
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Year:
2001

Citing 10
Cited 1

On the computational geometry of pocket machining

On the computational geometry of pocket machining
Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design

SIAM Journal on Computing
Fast computation of generalized Voronoi diagrams using graphics hardware

Proceedings of the 26th annual conference on Computer graphics and interactive techniques
VRONI: an engineering approach to the reliable and efficient computation of voronoi diagrams of points and line segments

Computational Geometry: Theory and Applications
Finding the Medial Axis of a Simple Polygon in Linear Time

ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
A Topology Oriented Algorithm for the Voronoi Diagram of Polygons

Proceedings of the 8th Canadian Conference on Computational Geometry
Heuristics for the Generation of Random Polygons

Proceedings of the 8th Canadian Conference on Computational Geometry
Generalized voronoi diagrams and geometric searching.

Generalized voronoi diagrams and geometric searching.

Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

Voronoi diagrams of pockets, i.e. polygons with holes, have a variety of important applications but are particularly challenging to compute robustly. We report on an implementation of a simple algorithm which does not rely on exact arithmetic to achieve robustness; rather, it achieves its robustness through carefully engineered handling of geometric predicates. Although we do not give theoretical guarantees for robustness or accuracy, the software has sustained extensive experimentation (on real and simulated data) and day-to-day usage on real-world data. The algorithm is shown experimentally to compare favorably in running time with prior methods.