Pages that link to "Item:Q1346251"
From MaRDI portal
The following pages link to Derandomizing an output-sensitive convex hull algorithm in three dimensions (Q1346251):
Displaying 10 items.
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- Hausdorff approximation of 3D convex polytopes (Q963404) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- An optimal convex hull algorithm in any fixed dimension (Q1312190) (← links)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
- Linear time approximation of 3D convex polytopes (Q1862132) (← links)
- Convex hulls of spheres and convex hulls of disjoint convex polytopes (Q1947973) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)
