Order-k Voronoi diagrams of sites with additive weights in the plane
From MaRDI portal
Publication:802900
DOI10.1007/BF01759056zbMATH Open0726.68081MaRDI QIDQ802900FDOQ802900
Authors: Harald Rosenberger 
Publication date: 1991
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- 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
- Generalized Dirichlet tesselations
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Generalization of Voronoi Diagrams in the Plane
- Edge-skeletons in arrangements with applications
- Circles through two points that always enclose many points
Cited In (11)
- Title not available (Why is that?)
- Faster algorithms for cycle hitting problems on disk graphs
- The higher-order Voronoi diagram of line segments
- 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)
