Computing the Implicit Voronoi Diagram in Triple Precision
From MaRDI portal
Publication:3183479
DOI10.1007/978-3-642-03367-4_43zbMath1253.68340WikidataQ56970250 ScholiaQ56970250MaRDI QIDQ3183479
Jack Scott Snoeyink, David L. Millman
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
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
68W20: Randomized algorithms
Uses Software
Cites Work
- Unnamed Item
- Towards exact geometric computation
- A sweepline algorithm for Voronoi diagrams
- Randomized incremental construction of Delaunay and Voronoi diagrams
- A probabilistic analysis of the power of arithmetic filters
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Reporting curve segment intersections using restricted predicates
- Further results on arithmetic filters for geometric predicates
- Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
- Robust Plane Sweep for Intersecting Segments