Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\)
From MaRDI portal
Publication:990950
DOI10.1016/j.ipl.2009.07.018zbMath1206.68317OpenAlexW1966935973MaRDI QIDQ990950
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
Cites Work
- Unnamed Item
- Unnamed Item
- On the all-farthest-segments problem for a planar set of points
- Farthest line segment Voronoi diagrams
- 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
- Extremal point queries with lines and line segments and related problems
This page was built for publication: Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\)