Pages that link to "Item:Q2489537"
From MaRDI portal
The following pages link to Proximity problems on line segments spanned by points (Q2489537):
Displaying 12 items.
- All-maximum and all-minimum problems under some measures (Q396657) (← links)
- On the all-farthest-segments problem for a planar set of points (Q845846) (← links)
- Farthest line segment Voronoi diagrams (Q845871) (← links)
- Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\) (Q990950) (← links)
- Optimal time bounds for some proximity problems in the plane (Q1198024) (← links)
- Largest and smallest area triangles on imprecise points (Q1984599) (← links)
- Computing Euclidean Steiner trees over segments (Q2219516) (← links)
- An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points (Q2380039) (← links)
- Computing closest and farthest points for a query segment (Q2481974) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
- Proximity on equilateral spaces (Q3219448) (← links)
- Multidimensional Lines II: Proximity and Applications (Q4292629) (← links)