Pages that link to "Item:Q4366880"
From MaRDI portal
The following pages link to On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm (Q4366880):
Displaying 12 items.
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- An efficient and numerically correct algorithm for the 2D convex hull problem (Q919797) (← links)
- A new algorithm for computing the convex hull of a planar point set (Q926679) (← links)
- Random convex hulls and extreme value statistics (Q967627) (← links)
- Derandomizing an output-sensitive convex hull algorithm in three dimensions (Q1346251) (← links)
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel (Q1367171) (← links)
- An output sensitive algorithm for discrete convex hulls (Q1388138) (← links)
- Convex-hull algorithms: implementation, testing, and experimentation (Q1712057) (← links)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- Computing the convex hull in the Euclidean plane in linear expected time (Q3974960) (← links)
- Distribution-sensitive algorithms (Q5054869) (← links)
- (Q5091039) (← links)
