Divide and conquer for linear expected time
Jon Louis Bentley, Michael Ian Shamos · Information Processing Letters · 1978
Cited by 117 works. doi:10.1016/0020-0190(78)90051-0
Authors
References
- An efficient algorith for determining the convex hull of a finite planar set
- Closest-point problems
- Geometric complexity
- Convex hulls of finite sets of points in two and three dimensions
- Geometric intersection problems
- Integral Geometry and Geometric Probability
- On the identification of the convex hull of a finite set of points in the plane
- �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten
- A New Convex Hull Algorithm for Planar Sets
- On the Average Number of Maxima in a Set of Vectors and Applications