Pages that link to "Item:Q911280"
From MaRDI portal
The following pages link to A sublogarithmic convex hull algorithm (Q911280):
Displaying 13 items.
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas (Q672261) (← links)
- An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images (Q673013) (← links)
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- Finding the convex hull of a sorted point set in parallel (Q1108791) (← links)
- Parallel construction of subdivision hierarchies (Q1124347) (← links)
- Iterative algorithms for the planar convex hull problem on mesh-connected arrays (Q1184542) (← links)
- Constructing the convex hull of a partially sorted set of points (Q1803271) (← links)
- Robust algorithms for constructing strongly convex hulls in parallel. (Q1853528) (← links)
- A time-optimal parallel algorithm for three-dimensional convex hulls (Q1899449) (← links)
- A BSP realisation of Jarvis' algorithm (Q2718466) (← links)
- A 1 log N parallel algorithm for detecting convex hulls on image boards (Q4503344) (← links)
- Finding the Convex Hull of Discs in Parallel (Q4513213) (← links)
- CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS (Q4682156) (← links)