Computing planar Voronoi diagrams in double precision, a further example of degree-driven algorithm design

DOI10.1145/1810959.1811024MaRDI QIDQ5405905zbMATH OpenOpenAlexDBLPWikidataFDO

Authors David L. Millman, Jack Snoeyink

Publication date 3 April 2014

Published in Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1810959.1811024

zbMATH Keywords

low-degree primitivesreduced precisionrobust computationVoronoi diagrams

Mathematics Subject Classification ID

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

Recommendations

• Computing the Implicit Voronoi Diagram in Triple Precision
• Degree-driven design for correct geometric algorithms
• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
• Two design principles of geometric algorithms in finite-precision arithmetic
• Rounding Voronoi diagram

Cited in

(5)

• Degree-driven design for correct geometric algorithms
• Computing the Implicit Voronoi Diagram in Triple Precision
• A probabilistic approach to reducing algebraic complexity of Delaunay triangulations
• A low arithmetic-degree algorithm for computing proximity graphs
• Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)

This page was built for publication: Computing planar Voronoi diagrams in double precision, a further example of degree-driven algorithm design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405905)