Pages that link to "Item:Q1254857"
From MaRDI portal
The following pages link to A note on the all nearest-neighbor problem for convex polygons (Q1254857):
Displayed 9 items.
- A note on the proof of a concurrent program (Q754631) (← links)
- An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons (Q786507) (← links)
- The symmetric all-furthest-neighbor problem (Q789727) (← links)
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- Tetrahedrizing point sets in three dimensions (Q2638826) (← links)
- Complexity, convexity, and unimodality (Q3219150) (← links)
- Selection and sorting in totally monotone arrays (Q3979609) (← links)