Abstract
A new algorithm is given for finding the convex hull of a finite set of distinct points in three-dimensional space. The algorithm finds the faces of the hull one by one, thus gradually building the polyhedron that constitutes the hull. The algorithm is described as developed through stepwise refinement.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. W. Dijkstra,A Discipline of Programming, Prentice-Hall, Inc., Englewood Cliffs, N.J., (1976).
R. A. Jarvis,On the identification of the convex hull of a finite set of points in the plane, Inform. Proc. Letters 2 (1973), 18–21.
F. P. Preparata and S. J. Hong,Convex hulls of finite sets of points in two and three dimensions, CACM 20, 2 (Febr. 1977), 87–93.
J. L. Bentley and M. I. Shamos,Divide and conquer for linear expected time, Inform. Proc. Letters 7 (1978), 87–91.
D. R. Chand and Sham S. Kapur,An algorithm for convex polytopes, Journ. ACM 17 (1970), 78–86.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Johansen, G.H., Gram, C. A simple algorithm for building the 3-D convex hull. BIT 23, 145–160 (1983). https://doi.org/10.1007/BF02218436
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02218436