A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams
From MaRDI portal
Publication:2942610
DOI10.1007/978-3-319-13075-0_3zbMath1432.68492OpenAlexW2205726886MaRDI QIDQ2942610
Maksym Zavershynskyi, Cecilia Bohler, Evanthia Papadopoulou, Chih-Hung Liu
Publication date: 11 September 2015
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-13075-0_3
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)
Related Items (3)
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams ⋮ On the complexity of higher order abstract Voronoi diagrams ⋮ The higher-order Voronoi diagram of line segments
Cites Work
- Randomized incremental construction of abstract Voronoi diagrams
- On the construction of abstract Voronoi diagrams
- Abstract Voronoi diagrams revisited
- Concrete and abstract Voronoi diagrams
- New applications of random sampling in computational geometry
- A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
- Taking a Walk in a Planar Arrangement
- Higher Order City Voronoi Diagrams
- An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram
- A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS
- An Improved Algorithm for Constructing kth-Order Voronoi Diagrams
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
- Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
- On Higher Order Voronoi Diagrams of Line Segments
- On the Complexity of Higher Order Abstract Voronoi Diagrams
- Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes
This page was built for publication: A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams
