An efficient randomized algorithm for higher-order abstract Voronoi diagrams
From MaRDI portal
Publication:3132855
DOI10.4230/LIPICS.SOCG.2016.21zbMATH Open1387.68242OpenAlexW2470741436MaRDI QIDQ3132855FDOQ3132855
Authors: Cecilia Bohler, Rolf Klein, Chih-Hung Liu 
Publication date: 30 January 2018
Full work available at URL: https://doi.org/10.4230/LIPIcs.SoCG.2016.21
Recommendations
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
- Randomized incremental construction of abstract Voronoi diagrams
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
- scientific article; zbMATH DE number 18530
Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (12)
- Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
- On the complexity of higher order abstract Voronoi diagrams
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time.
- Randomized incremental construction of simple abstract Voronoi diagrams in 3-space
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams
- On the Complexity of Randomly Weighted Voronoi Diagrams
- On the complexity of higher order abstract Voronoi diagrams
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
- A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS
- Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
- Improved time-space trade-offs for computing Voronoi diagrams
This page was built for publication: An efficient randomized 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 Q3132855)
