Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments

DOI10.1007/978-3-642-28076-4_7zbMath1350.68255OpenAlexW72509955MaRDI QIDQ2889899

Sang Won Bae

Publication date: 8 June 2012

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items

On farthest Bregman Voronoi cells ⋮ Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments ⋮ On farthest Voronoi cells