On the construction of abstract Voronoi diagrams
From MaRDI portal
Publication:757052
DOI10.1007/BF02574686zbMath0723.68048MaRDI QIDQ757052
Kurt Mehlhorn, Stefan Meiser, Colm P. O'Dunlaing
Publication date: 1991
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131155
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (27)
Abstract Voronoi diagram in 3-space ⋮ ``The big sweep: On the power of the wavefront approach to Voronoi diagrams ⋮ A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis ⋮ On non-smooth convex distance functions ⋮ Abstract Voronoi diagrams revisited ⋮ Using geometry to solve the transportation problem in the plane ⋮ A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams ⋮ A compact piecewise-linear Voronoi diagram for convex sites in the plane ⋮ Incremental topological flipping works for regular triangulations ⋮ Randomized incremental construction of simple abstract Voronoi diagrams in 3-space ⋮ Randomized geometric algorithms and pseudorandom generators ⋮ A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams ⋮ Voronoi diagrams for polygon-offset distance functions ⋮ Randomized incremental construction of Delaunay and Voronoi diagrams ⋮ Searching for segments with largest relative overlap ⋮ Randomized incremental construction of abstract Voronoi diagrams ⋮ Four results on randomized incremental constructions ⋮ Fully dynamic Delaunay triangulation in logarithmic expected per operation ⋮ Voronoi diagrams for convex polygon-offset distance functions ⋮ On the randomized construction of the Delaunay tree ⋮ Randomized incremental construction of simple abstract Voronoi diagrams in 3-space ⋮ On lazy randomized incremental construction ⋮ Four results on randomized incremental constructions ⋮ A fast algorithm for data collection along a fixed track ⋮ VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE ⋮ ABSTRACT VORONOI DIAGRAMS WITH DISCONNECTED REGIONS ⋮ On the complexity of higher order abstract Voronoi diagrams
Cites Work
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Voronoi diagrams and arrangements
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
- A sweepline algorithm for Voronoi diagrams
- Geometric relations among Voronoi diagrams
- Voronoi diagrams from convex hulls
- Concrete and abstract Voronoi diagrams
- Applications of random sampling in computational geometry. II
- Voronoi Diagram in the Laguerre Geometry and Its Applications
- Intersection and Closest-Pair Problems for a Set of Planar Discs
- Improved algorithms for discs and balls using power diagrams
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- Power Diagrams: Properties, Algorithms and Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the construction of abstract Voronoi diagrams
