Abstract Voronoi diagrams revisited

DOI10.1016/j.comgeo.2009.03.002zbMath1173.65014OpenAlexW2015545367MaRDI QIDQ833716

Rolf Klein, Elmar Langetepe, Zahra Nilforoushan

Publication date: 14 August 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.03.002

zbMATH Keywords

computational geometryfinite intersection propertyabstract Voronoi diagramsdistance problems

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (21)

The L∞ Hausdorff Voronoi Diagram Revisited ⋮ A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams ⋮ An approximation algorithm for computing shortest paths in weighted 3-d domains ⋮ A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams ⋮ An efficient randomized algorithm for higher-order abstract Voronoi diagrams ⋮ Deletion in abstract Voronoi diagrams in expected linear time and related problems ⋮ Incremental Voronoi diagrams ⋮ Forest-like abstract Voronoi diagrams in linear time ⋮ Link distance and shortest path problems in the plane ⋮ Computing the map of geometric minimal cuts ⋮ On Birkhoff orthogonality and isosceles orthogonality in normed linear spaces ⋮ Extended box clustering for classification problems ⋮ A fast algorithm for data collection along a fixed track ⋮ Non-centered Voronoi Skeletons ⋮ Deletion in Abstract Voronoi Diagrams in Expected Linear Time. ⋮ Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time ⋮ Abstract Voronoi Diagrams from Closed Bisecting Curves ⋮ ABSTRACT VORONOI DIAGRAMS WITH DISCONNECTED REGIONS ⋮ On the complexity of randomly weighted multiplicative Voronoi diagrams ⋮ On the complexity of higher order abstract Voronoi diagrams ⋮ The higher-order Voronoi diagram of line segments

Uses Software

• Voronoi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized incremental construction of abstract Voronoi diagrams
• On the construction of abstract Voronoi diagrams
• The converse of the Jordan curve theorem and a characterization of planar maps
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Voronoi diagrams and arrangements
• Concrete and abstract Voronoi diagrams
• On the computational geometry of pocket machining
• Casting a polyhedron with directional uncertainty
• Quickest paths, straight skeletons, and the city Voronoi diagram
• Applications of random sampling in computational geometry. II
• Abstract Voronoi diagram in 3-space
• A compact piecewise-linear Voronoi diagram for convex sites in the plane
• Dynamic construction of abstract Voronoi diagrams
• FURTHEST SITE ABSTRACT VORONOI DIAGRAMS
• GEOMETRY OF BISECTORS FOR STRICTLY CONVEX DISTANCES
• Convex and Discrete Geometry
• VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE
• Algorithms - ESA 2003

This page was built for publication: Abstract Voronoi diagrams revisited