A sweepline algorithm for Voronoi diagrams

1987/11/01 by Steven Fortune · 9 citations
Computer Science · Environmental Science · #Computational Geometry and Mesh Generation #Computer Graphics and Visualization Techniques #Remote Sensing and LiDAR Applications

paper · doi:10.1007/bf01840357

crossref issued 1987/11/01 · crossref published 1987/11/01 · crossref published-print 1987/11/01 · openalex publication_date 1987/11/01 · crossref created 2005/06/29 · crossref deposited 2020/04/08 · openalex created_date 2025/10/10 · crossref indexed 2026/06/22 · openalex updated_date 2026/07/29

Cited by

• The catchment area of jets
• Spanners of Additively Weighted Point Sets
• Combinatorial complexity bounds for arrangements of curves and spheres
• Hot ice computer
• A faster divide-and-conquer algorithm for constructing delaunay triangulations
• An O(n² log n) Time Algorithm for the Minmax Angle Triangulation
• Randomized incremental construction of Delaunay and Voronoi diagrams
• Enhancing Binary Search via Overlapping Partitions
• Fortune's algorithm [wikipedia]