Pages that link to "Item:Q4889509"
From MaRDI portal
The following pages link to A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET (Q4889509):
Displaying 6 items.
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
- A parallel algorithm for the conductor of a point set (Q1289527) (← links)
- Recursion and parallel algorithms in geometric modeling problems (Q1956990) (← links)
- Optimal parallel algorithms for proximate points, with applications (Q5096941) (← links)
- Techniques and Open Questions in Computational Convex Analysis (Q5746453) (← links)