A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS

DOI10.1142/S0218195992000214zbMath0803.68131OpenAlexW2103777374MaRDI QIDQ3136224

Franz Aurenhammer, Otfried Schwarzkopf

Publication date: 17 October 1993

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195992000214

zbMATH Keywords

computational geometryrandomized incremental algorithmhigher order Voronoi diagram

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (15)

An introduction to randomization in computational geometry ⋮ From proximity to utility: a Voronoi partition of Pareto optima ⋮ A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams ⋮ A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams ⋮ Degree distributions in \(AB\) random geometric graphs ⋮ An efficient randomized algorithm for higher-order abstract Voronoi diagrams ⋮ Multiple covers with balls. I: Inclusion-exclusion ⋮ CENTROID TRIANGULATIONS FROM k-SETS ⋮ Separation by convex pseudo-circles ⋮ The multi-cover persistence of Euclidean balls ⋮ Bivariate B-splines from convex configurations ⋮ The Multi-cover Persistence of Euclidean Balls ⋮ The \(k\)-nearest-neighbor Voronoi diagram revisited ⋮ Voronoi diagrams on the sphere ⋮ The higher-order Voronoi diagram of line segments

This page was built for publication: A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS