Pages that link to "Item:Q2380039"

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 8 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)
• A linear time algorithm for finding all farthest neighbors in a convex polygon (Q1123027) (← links)
• Computing farthest neighbors on a convex polytope. (Q1401257) (← links)
• Largest and smallest area triangles on imprecise points (Q1984599) (← links)
• An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem (Q3685220) (← links)