Pages that link to "Item:Q2380039"
From MaRDI portal
The following pages link to An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points (Q2380039):
Displaying 5 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)
- Largest and smallest area triangles on imprecise points (Q1984599) (← links)
