Randomized quickhull
From MaRDI portal
Publication:675302
DOI10.1007/BF02523195zbMATH Open0865.68123OpenAlexW3190573802MaRDI QIDQ675302FDOQ675302
Publication date: 6 March 1997
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02523195
Cites Work
- An efficient algorithm for determining the convex hull of a finite planar set
- New applications of random sampling in computational geometry
- Applications of random sampling in computational geometry. II
- Title not available (Why is that?)
- A New Convex Hull Algorithm for Planar Sets
- A fast convex hull algorithm
- Convex hull of a finite set of points in two dimensions
- The Ultimate Planar Convex Hull Algorithm?
- On the identification of the convex hull of a finite set of points in the plane
- A Randomized Algorithm for Closest-Point Queries
- Title not available (Why is that?)
- Divide and conquer for linear expected time
- A Lower Bound to Finding Convex Hulls
- Constructing the convex hull of a set of points in the plane
- A more efficient convex hull algorithm
- Comments on a lower bound for convex hull determination
- How to reduce the average complexity of convex hull finding algorithms
Cited In (6)
Recommendations
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)