On the all-farthest-segments problem for a planar set of points

DOI10.1016/j.ipl.2006.06.015zbMath1185.68785OpenAlexW2107945074MaRDI QIDQ845846

Samidh Chatterjee, Benjamin Lafreniere, Asish Kumar Mukhopadhyay

Publication date: 29 January 2010

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

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

zbMATH Keywords

algorithmscomputational complexityanalysis of algorithmsdesign of algorithmscomputational geometry

Mathematics Subject Classification ID

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

Related Items (5)

Farthest line segment Voronoi diagrams ⋮ An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points ⋮ 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
• A simple algorithm for computing the smallest enclosing circle
• An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
• Proximity problems on line segments spanned by points

This page was built for publication: On the all-farthest-segments problem for a planar set of points