An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram

DOI10.1007/978-3-642-23719-5_7zbMath1346.68232OpenAlexW309158517MaRDI QIDQ3092218

Evanthia Papadopoulou, Chih-Hung Liu, Der-Tsai Lee

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_7

Mathematics Subject Classification ID

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

Related Items (5)

A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams ⋮ The impact of heterogeneity and geometry on the proof complexity of random satisfiability ⋮ Survivable minimum bottleneck networks ⋮ The \(k\)-nearest-neighbor Voronoi diagram revisited ⋮ On the complexity of higher order abstract Voronoi diagrams

This page was built for publication: An Output-Sensitive Approach for the L 1/L  ∞  k-Nearest-Neighbor Voronoi Diagram