Pages that link to "Item:Q1123027"
From MaRDI portal
The following pages link to A linear time algorithm for finding all farthest neighbors in a convex polygon (Q1123027):
Displaying 13 items.
- Base station placement on boundary of a convex polygon (Q436692) (← links)
- The symmetric all-furthest-neighbor problem (Q789727) (← links)
- On the angle restricted nearest neighbor problem (Q910232) (← links)
- An optimal algorithm with unknown time complexity for convex matrix searching (Q917275) (← links)
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
- Computing external farthest neighbors for a simple polygon (Q1175781) (← links)
- An optimal parallel algorithm for computing furthest neighbors in a tree (Q1205722) (← links)
- Computing farthest neighbors on a convex polytope. (Q1401257) (← links)
- On computing the optimal bridge between two convex polygons. (Q1603485) (← links)
- Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
- Selection and sorting in totally monotone arrays (Q3979609) (← links)
- Linear algorithm to find the largest intriangles of a planar convex polygon (Q4246478) (← links)
- An efficient algorithm for the three-dimensional diameter problem (Q5932809) (← links)
