Computing the Implicit Voronoi Diagram in Triple Precision

DOI10.1007/978-3-642-03367-4_43MaRDI QIDQ3183479zbMATH OpenOpenAlexWikidataFDO

Authors David L. Millman, Jack Snoeyink

Publication date 20 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03367-4_43

zbMATH Keywords

low-degree primitivesrandomized algorithmrobust computationVoronoi diagram

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Recommendations

• Computing planar Voronoi diagrams in double precision, a further example of degree-driven algorithm design
• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
• Randomized incremental construction of Delaunay and Voronoi diagrams
• Randomized incremental construction of abstract Voronoi diagrams
• scientific article; zbMATH DE number 177830

Cites work

• A probabilistic analysis of the power of arithmetic filters
• A sweepline algorithm for Voronoi diagrams
• Adaptive precision floating-point arithmetic and fast robust geometric predicates
• Computational geometry. Algorithms and applications.
• Further results on arithmetic filters for geometric predicates
• Randomized incremental construction of Delaunay and Voronoi diagrams
• Reporting curve segment intersections using restricted predicates
• Robust Plane Sweep for Intersecting Segments
• Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
• Towards exact geometric computation

Cited in

(1)

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

Describes a project that uses

Uses Software

• CGAL
• LEDA

This page was built for publication: Computing the Implicit Voronoi Diagram in Triple Precision

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