Determining the three-dimensional convex hull of a polyhedron

Authors:
A. Appel;P. M. Will
Affiliations:
IBM Thomas J. Watson Research Center, Yorktown Heights, New York;IBM Thomas J. Watson Research Center, Yorktown Heights, New York
Venue:
IBM Journal of Research and Development
Year:
1976

Citing 6
Cited 0

Efficient Planarity Testing

Journal of the ACM (JACM)
A Search Procedure for Hamilton Paths and Circuits

Journal of the ACM (JACM)
Computer Processing of Line-Drawing Images

ACM Computing Surveys (CSUR)
Normalization techniques for handprinted numerals

Communications of the ACM
The notion of quantitative invisibility and the machine rendering of solids

ACM '67 Proceedings of the 1967 22nd national conference
PRADIS: an advanced programming system for 3-D-display

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method is presented for determining the three-dimensional convex hull of a real object that is approximated in computer storage by a polyhedron. Essentially, this technique tests all point pairs of the polyhedron for convex edges of the convex hull and then assembles the edges into the polygonal boundaries of each of the faces of the convex hull. Various techniques for optimizing this process are discussed. A computer program has been written, and typical output shapes are illustrated. Finding the three-dimensional convex hull is approximately the same computer burden as eliminating hidden lines.