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

DOI10.1007/BF01759056zbMath0726.68081MaRDI QIDQ802900

Harald Rosenberger

Publication date: 1991

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

Voronoi diagramsgeometric transformationsweep algorithm

Mathematics Subject Classification ID

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

Related Items (6)

A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams ⋮ Faster algorithms for cycle hitting problems on disk graphs ⋮ An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane ⋮ Range search on tuples of points ⋮ Topological sweep of the complete graph ⋮ The higher-order Voronoi diagram of line segments

Cites Work

• Unnamed Item
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• Generalized Dirichlet tesselations
• Edge-skeletons in arrangements with applications
• Circles through two points that always enclose many points
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Generalization of Voronoi Diagrams in the Plane
• On k-Nearest Neighbor Voronoi Diagrams in the Plane

This page was built for publication: Order-k Voronoi diagrams of sites with additive weights in the plane