Recommendations
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 910884 (Why is no real title available?)
- A Lower Bound to Finding Convex Hulls
- A New Convex Hull Algorithm for Planar Sets
- A Randomized Algorithm for Closest-Point Queries
- A fast convex hull algorithm
- A more efficient convex hull algorithm
- An efficient algorithm for determining the convex hull of a finite planar set
- Applications of random sampling in computational geometry. II
- Comments on a lower bound for convex hull determination
- Constructing the convex hull of a set of points in the plane
- Convex hull of a finite set of points in two dimensions
- Divide and conquer for linear expected time
- How to reduce the average complexity of convex hull finding algorithms
- New applications of random sampling in computational geometry
- On the identification of the convex hull of a finite set of points in the plane
- The Ultimate Planar Convex Hull Algorithm?
Cited in
(9)- Convex hull for intersections of random lines
- A note on the expected time required to construct the outer layer
- Quicker than Quickhull
- Space-efficient planar convex hull algorithms
- scientific article; zbMATH DE number 17632 (Why is no real title available?)
- Convex-hull algorithms: implementation, testing, and experimentation
- Random convex hulls and extreme value statistics
- QuickhullDisk: a faster convex hull algorithm for disks
- Distribution-sensitive algorithms
This page was built for publication: Randomized quickhull
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675302)
