Order-k Voronoi diagrams of sites with additive weights in the plane
From MaRDI portal
(Redirected from Publication:802900)
Recommendations
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Circles through two points that always enclose many points
- Edge-skeletons in arrangements with applications
- Generalization of Voronoi Diagrams in the Plane
- Generalized Dirichlet tesselations
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Cited in
(11)- The higher-order Voronoi diagram of line segments
- scientific article; zbMATH DE number 1507307 (Why is no real title available?)
- Faster algorithms for cycle hitting problems on disk graphs
- Connecting red cells in a bicolour Voronoi diagram
- An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane
- Range search on tuples of points
- Algorithms – ESA 2005
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
- Topological sweep of the complete graph
- Weighted Voronoi diagrams in the maximum norm
This page was built for publication: Order-k Voronoi diagrams of sites with additive weights in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802900)