Pages that link to "Item:Q1401257"
From MaRDI portal
The following pages link to Computing farthest neighbors on a convex polytope. (Q1401257):
Displaying 9 items.
- Group nearest-neighbor queries in the \(L_1\) plane (Q500965) (← links)
- On the all-farthest-segments problem for a planar set of points (Q845846) (← links)
- Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\) (Q990950) (← links)
- Computing external farthest neighbors for a simple polygon (Q1175781) (← links)
- Geometric applications of posets (Q1276942) (← links)
- Computing geodesic furthest neighbors in simple polygons (Q1822979) (← links)
- An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points (Q2380039) (← links)
- Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
- On Some Proximity Problems of Colored Sets (Q2867120) (← links)