An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points

DOI10.1016/j.ipl.2007.08.004zbMath1184.68560OpenAlexW2170820578MaRDI QIDQ2380039

Asish Kumar Mukhopadhyay, Robert L. Scot Drysdale

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.004

zbMATH Keywords

computational geometryfarthest-segment Voronoi diagram

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

On the all-farthest-segments problem for a planar set of points ⋮ Farthest line segment Voronoi diagrams ⋮ All-maximum and all-minimum problems under some measures ⋮ Largest and smallest area triangles on imprecise points ⋮ Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\)

Cites Work

• Unnamed Item
• On the all-farthest-segments problem for a planar set of points
• Farthest line segment Voronoi diagrams
• 2-point site Voronoi diagrams
• Proximity problems on line segments spanned by points
• Generalization of Voronoi Diagrams in the Plane

This page was built for publication: An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points