On the Complexity of Higher Order Abstract Voronoi Diagrams

DOI10.1007/978-3-642-39206-1_18zbMath1336.68259OpenAlexW1837161170MaRDI QIDQ5326562

Cecilia Bohler, Rolf Klein, Evanthia Papadopoulou, Maksym Zavershynskyi, Chih-Hung Liu, Panagiotis Cheilaris

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_18

zbMATH Keywords

computational geometryVoronoi diagramsabstract Voronoi diagramsdistance problemshigher-order Voronoi diagrams

Mathematics Subject Classification ID

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

Related Items

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