“The big sweep”: On the power of the wavefront approach to Voronoi diagrams
From MaRDI portal
Publication:5096887
Recommendations
- ``The big sweep: On the power of the wavefront approach to Voronoi diagrams
- A sweepline algorithm for Voronoi diagrams
- scientific article; zbMATH DE number 4060717
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (extended abstract)
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
- The probabilistic complexity of the Voronoi diagram of points on a polyhedron
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
- Divide-and-conquer for Voronoi diagrams revisited
Cites work
- scientific article; zbMATH DE number 4060717 (Why is no real title available?)
- A sweepline algorithm for Voronoi diagrams
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations
- Applications of random sampling in computational geometry. II
- Concrete and abstract Voronoi diagrams
- Randomized incremental construction of abstract Voronoi diagrams
- Some dynamic computational geometry problems
- Voronoi diagrams and arrangements
- Voronoi diagrams from convex hulls
Cited in
(2)
This page was built for publication: “The big sweep”: On the power of the wavefront approach to Voronoi diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096887)
