An efficient randomized algorithm for higher-order abstract Voronoi diagrams

DOI10.4230/LIPICS.SOCG.2016.21MaRDI QIDQ3132855zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

abstract Voronoi diagramsorder-\(k\) Voronoi diagramsrandomized geometric algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

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

Cited in

(11)

• On the complexity of higher order abstract Voronoi diagrams
• An efficient randomized algorithm for higher-order abstract Voronoi diagrams
• Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
• Deletion in Abstract Voronoi Diagrams in Expected Linear Time.
• A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
• Randomized incremental construction of simple abstract Voronoi diagrams in 3-space
• On the Complexity of Randomly Weighted Voronoi Diagrams
• A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS
• A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
• Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
• On the complexity of higher order abstract 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)