Proximity problems on line segments spanned by points
From MaRDI portal
Publication:2489537
DOI10.1016/j.comgeo.2005.08.007zbMath1114.65018OpenAlexW1977633508MaRDI QIDQ2489537
David M. Mount, Jun Luo, Ovidiu Daescu
Publication date: 28 April 2006
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2005.08.007
Related Items (7)
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 ⋮ All-maximum and all-minimum problems under some measures ⋮ Computing Euclidean Steiner trees over segments ⋮ Largest and smallest area triangles on imprecise points ⋮ Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Selecting distances in arrangements of hyperplanes spanned by points.
- Randomized optimal algorithm for slope selection
- Optimal slope selection via cuttings
- An Optimal-Time Algorithm for Slope Selection
- Off-Line Maintenance of Planar Configurations
- SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
- An Expander-Based Approach to Geometric Optimization
- ON ENUMERATING AND SELECTING DISTANCES
- A tight bound for the number of different directions in three dimensions
- Solution of Scott's problem on the number of directions determined by a point set in 3-space
- Farthest-Point Queries with Geometric and Combinatorial Constraints
- Separating objects in the plane by wedges and strips
- Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
- A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
This page was built for publication: Proximity problems on line segments spanned by points
