On the Expected Complexity of Voronoi Diagrams on Terrains

DOI10.1145/2846099zbMath1445.68252arXiv1112.0695OpenAlexW2569453482MaRDI QIDQ4962614

Anne Driemel, Benjamin Raichel, Sariel Har-Peled

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.0695

zbMATH Keywords

random inputsVoronoi diagrams on terrains

Mathematics Subject Classification ID

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

Related Items (2)

The impact of heterogeneity and geometry on the proof complexity of random satisfiability ⋮ Unnamed Item

This page was built for publication: On the Expected Complexity of Voronoi Diagrams on Terrains