Pages that link to "Item:Q750155"
From MaRDI portal
The following pages link to An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon (Q750155):
Displaying 7 items.
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
- A parallel algorithm for finding congruent regions (Q1262793) (← links)
- A parallel algorithm for the conductor of a point set (Q1289527) (← links)
- Faster bottleneck non-crossing matchings of points in convex position (Q2401333) (← links)
- Fast Matching Algorithms for Points on a Polygon (Q3978776) (← links)
- An <i>EP</i> Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane (Q4319328) (← links)
- (Q4500844) (← links)