“The big sweep”: On the power of the wavefront approach to Voronoi diagrams

DOI10.1007/3-540-58338-6_76zbMath1493.68369OpenAlexW264218544MaRDI QIDQ5096887

Rolf Klein, Frank Dehne

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_76

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Randomized incremental construction of abstract Voronoi diagrams
• An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations
• Some dynamic computational geometry problems
• Voronoi diagrams and arrangements
• A sweepline algorithm for Voronoi diagrams
• Voronoi diagrams from convex hulls
• Concrete and abstract Voronoi diagrams
• Applications of random sampling in computational geometry. II

This page was built for publication: “The big sweep”: On the power of the wavefront approach to Voronoi diagrams