Order-k Voronoi diagrams of sites with additive weights in the plane

DOI10.1007/BF01759056MaRDI QIDQ802900zbMATH OpenFDO

Authors Harald Rosenberger

Publication date 1991

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01759056

zbMATH Keywords

geometric transformationsweep algorithmVoronoi diagrams

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An Improved Algorithm for Constructing kth-Order Voronoi Diagrams
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• scientific article; zbMATH DE number 1947424
• A new duality result concerning Voronoi diagrams
• A new duality result concerning Voronoi diagrams

Cites work

• 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
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• 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

(13)

• Topological sweep of the complete graph
• Finding constrained and weighted Voronoi diagrams in the plane
• Range search on tuples of points
• The higher-order Voronoi diagram of line segments
• An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane
• A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
• scientific article; zbMATH DE number 1507307 (Why is no real title available?)
• Connecting red cells in a bicolour Voronoi diagram
• Weighted Voronoi diagrams in the maximum norm
• Algorithms – ESA 2005
• Faster algorithms for cycle hitting problems on disk graphs
• Computing shortest paths amid non-overlapping weighted disks
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane

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)