Pages that link to "Item:Q1250433"
From MaRDI portal
The following pages link to The all nearest-neighbor problem for convex polygons (Q1250433):
Displaying 16 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)
- Applications of generalized matrix searching to geometric algorithms (Q913505) (← 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)
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- Optimal time bounds for some proximity problems in the plane (Q1198024) (← links)
- A note on the all nearest-neighbor problem for convex polygons (Q1254857) (← links)
- Heuristics for optimum binary search trees and minimum weight triangulation problems (Q1263993) (← links)
- Complexity, convexity, and unimodality (Q3219150) (← links)
- On finding the convex hull of a simple polygon (Q3331831) (← links)
- Selection and sorting in totally monotone arrays (Q3979609) (← links)
- DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES (Q5305064) (← links)
- Dilation-Optimal Edge Deletion in Polygonal Cycles (Q5387748) (← links)
