Optimal output-sensitive convex hull algorithms in two and three dimensions
- Cite this article as:
- Chan, T.M. Discrete Comput Geom (1996) 16: 361. doi:10.1007/BF02712873
- 584 Views
We present simple output-sensitive algorithms that construct the convex hull of a set ofn points in two or three dimensions in worst-case optimalO (n logh) time andO (n) space, whereh denotes the number of vertices of the convex hull.