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

DOI10.1016/J.IPL.2006.06.015MaRDI QIDQ845846zbMATH OpenOpenAlexFDO

Authors Samidh Chatterjee, Benjamin Lafreniere, Asish 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 algorithmscomputational geometrydesign of algorithms

Mathematics Subject Classification ID

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

Recommendations

• An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
• Farthest-Point Queries with Geometric and Combinatorial Constraints
• Computing closest and farthest points for a query segment
• Farthest-point queries with geometric and combinatorial constraints
• Computing farthest neighbors on a convex polytope.

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• 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

Cited in

(7)

• Farthest-Point Queries with Geometric and Combinatorial Constraints
• Farthest line segment Voronoi diagrams
• Largest and smallest area triangles on imprecise points
• All-maximum and all-minimum problems under some measures
• An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
• Farthest-point queries with geometric and combinatorial constraints
• Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\)

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

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