Tight bound for farthest-color Voronoi diagrams of line segments

DOI10.1007/978-3-642-28076-4_7zbMATH Open1350.68255OpenAlexW72509955MaRDI QIDQ2889899FDOQ2889899

Authors: 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

Recommendations

• Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
• On the farthest line-segment Voronoi diagram
• Farthest line segment Voronoi diagrams
• On the Farthest Line-Segment Voronoi Diagram
• Improved algorithms for the farthest colored Voronoi diagram of segments

Mathematics Subject Classification ID

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

Cited In (9)

• Improved algorithms for the farthest colored Voronoi diagram of segments
• On farthest Voronoi cells
• Farthest line segment Voronoi diagrams
• Improved algorithms for farthest colored Voronoi diagram of segments
• On farthest Bregman Voronoi cells
• On the farthest line-segment Voronoi diagram
• On the Farthest Line-Segment Voronoi Diagram
• Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions
• Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments

This page was built for publication: Tight bound for farthest-color Voronoi diagrams of line segments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889899)