Improved algorithms for the farthest colored Voronoi diagram of segments

DOI10.1016/j.tcs.2012.06.008zbMath1416.68200OpenAlexW2565630656MaRDI QIDQ391216

Jinhui Xu, Yongding Zhu

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.008

zbMATH Keywords

arc tracingfarthest colored Voronoi diagramfarthest-polygon Voronoi diagram

Mathematics Subject Classification ID

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

Related Items

Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments

Cites Work

• Unnamed Item
• Farthest line segment Voronoi diagrams
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• The upper envelope of Voronoi surfaces and its applications
• Farthest-Polygon Voronoi Diagrams
• Optimal Point Location in a Monotone Subdivision
• An Output-Sensitive Convex Hull Algorithm for Planar Objects

This page was built for publication: Improved algorithms for the farthest colored Voronoi diagram of segments