Pages that link to "Item:Q676065"
From MaRDI portal
The following pages link to Fast randomized parallel methods for planar convex hull construction (Q676065):
Displaying 10 items.
- Comments on two parallel algorithms for the planar convex hull problem (Q579833) (← links)
- Finding the convex hull of a sorted point set in parallel (Q1108791) (← links)
- Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel (Q1367171) (← links)
- Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima. (Q1398784) (← links)
- Synergistic solutions for merging and computing planar convex hulls (Q1790964) (← links)
- Robust algorithms for constructing strongly convex hulls in parallel. (Q1853528) (← links)
- Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
- On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm (Q4366880) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901278) (← links)