Farthest segments and extremal triangles spanned by points in R^3

DOI10.1016/J.IPL.2009.07.018MaRDI QIDQ990950zbMATH OpenOpenAlexFDO

Authors Steven Bitner, Ovidiu Daescu

Publication date 1 September 2010

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

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

zbMATH Keywords

computational geometryfarthest line segmentlargest trianglesmallest triangle

Mathematics Subject Classification ID

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

Recommendations

• Extremal point queries with lines and line segments and related problems
• Computing farthest neighbors on a convex polytope.
• Farthest neighbors, maximum spanning trees and related problems in higher dimensions
• Extremal problems on triangle areas in two and three dimensions
• scientific article; zbMATH DE number 1796963

Cites work

• An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
• Extremal point queries with lines and line segments and related problems
• Farthest line segment Voronoi diagrams
• scientific article; zbMATH DE number 6381744 (Why is no real title available?)
• scientific article; zbMATH DE number 5507867 (Why is no real title available?)
• On the all-farthest-segments problem for a planar set of points
• Proximity problems on line segments spanned by points

Cited in

(1)

• scientific article; zbMATH DE number 1796963 (Why is no real title available?)

This page was built for publication: Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\)

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