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

DOI10.1016/J.IPL.2006.06.015zbMATH Open1185.68785OpenAlexW2107945074MaRDI QIDQ845846FDOQ845846

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

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.

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)

Cites Work

• Title not available (Why is that?)
• 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
• All-maximum and all-minimum problems under some measures
• Farthest-point queries with geometric and combinatorial constraints
• Farthest line segment Voronoi diagrams
• Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\)
• An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
• Largest and smallest area triangles on imprecise points

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)