On the Farthest Line-Segment Voronoi Diagram

DOI10.1007/978-3-642-35261-4_22zbMATH Open1260.68421OpenAlexW1862650283MaRDI QIDQ4909535FDOQ4909535

Authors: Evanthia Papadopoulou, Sandeep Kumar Dey 

Publication date: 21 March 2013

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

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

Recommendations

• On the farthest line-segment Voronoi diagram
• Farthest line segment Voronoi diagrams
• Farthest-Polygon Voronoi Diagrams
• Farthest-polygon Voronoi diagrams
• On farthest Voronoi cells
• The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
• The furthest-site geodesic Voronoi diagram
• The higher-order Voronoi diagram of line segments
• The geodesic farthest-point Voronoi diagram in a simple polygon
• Tight bound for farthest-color Voronoi diagrams of line segments

Mathematics Subject Classification ID

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

Cited In (12)

• On farthest Voronoi cells
• Farthest-polygon Voronoi diagrams
• Farthest line segment Voronoi diagrams
• Tight bound for farthest-color Voronoi diagrams of line segments
• On farthest Bregman Voronoi cells
• On the farthest line-segment Voronoi diagram
• Euclidean farthest-point Voronoi diagram of a digital edge
• An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
• 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
• Map of geometric minimal cuts for general planar embedding
• Linear-time algorithms for the farthest-segment Voronoi diagram and related tree structures

This page was built for publication: On the Farthest Line-Segment Voronoi Diagram

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