Farthest-Polygon Voronoi Diagrams
From MaRDI portal
Publication:3527230
DOI10.1007/978-3-540-75520-3_37zbMath1151.68701arXiv1001.3593OpenAlexW1492998720MaRDI QIDQ3527230
Marc Glisse, Joachim Gudmundsson, Sylvain Lazard, Hazel Everett, Hyeon-Suk Na, Samuel Hornus, Otfried Schwarzkopf, Mi Ra Lee
Publication date: 25 September 2008
Published in: Algorithms – ESA 2007 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.3593
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Improved algorithms for the farthest colored Voronoi diagram of segments ⋮ On the central path problem ⋮ Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere ⋮ Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
