A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
DOI10.1007/978-3-319-13075-0_3zbMATH Open1432.68492OpenAlexW2205726886MaRDI QIDQ2942610FDOQ2942610
Authors: Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi 
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
Recommendations
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
- Randomized incremental construction of abstract Voronoi diagrams
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams
- A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS
Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Concrete and abstract Voronoi diagrams
- New applications of random sampling in computational geometry
- Higher order city Voronoi diagrams
- 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
- Abstract Voronoi diagrams revisited
- Randomized incremental construction of abstract Voronoi diagrams
- On the construction of abstract Voronoi diagrams
- A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
- Taking a walk in a planar arrangement
- Higher-order geodesic Voronoi diagrams in a polygonal domain with holes
- An output-sensitive approach for the \(L _{1}/L _{ \infty }\) \(k\)-nearest-neighbor Voronoi diagram
Cited In (7)
- The higher-order Voronoi diagram of line segments
- On the complexity of higher order abstract Voronoi diagrams
- Voronoi-like nondeterministic partition of a lattice by collectives of finite automata
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams
- On the complexity of higher order abstract Voronoi diagrams
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
This page was built for publication: A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942610)
