Convex Hulls of Finite Sets of Points in Two and Three Dimensions

Communications of the ACM

Volumn 20, Issue 2, 1977, Pages 87-93

  Preparata, F P ^a   Hong, S J ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

computational complexity; convex hull; optimal algorithms; planar set of points; spatial set of points

Indexed keywords

STRUCTURAL ANALYSIS - COMPUTER APPLICATIONS;

COMPUTER PROGRAMMING;

EID: 0017453547     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/359423.359430     Document Type: Article

References (11)

1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass, 1974.
2. Chand, D.R., and Kapur, S.S. An algorithm for convex polytopes. J. ACM 17, 7 (Jan. 1970), 78-86.
3. Freeman, H., and Shapira. R. Determining the minimum-area incasing rectangle for an arbitrary closed curve. Comm. ACM 18, 7 (July 1975), 409-413.
4. Gilbert, E.N., and Poliak, H. Steiner minimal trees. SIAM J. Appl.Math. 16, (1968), 1-29.
5. Graham, R.L. An efficient algorithm for determining the convex hull of a finite planar set, Inform. Proc. Lett. 1 (1972), 132-133.
6. Grünbaum, B. Convex Polytopes. Wiley Interscience, New York, 1967.
7. Jarvis, R.A. On the identification of the convex hull of a finite set of points in the plane. Inform. Proc. Lett. 2, (1973), 18-21.
8. Kung, H.T., Luccio, F., and Preparata, F.P. On finding the maxima of a set of vectors. J. ACM 22, 4 (Oct. 1975), 469-476.
9. Shamos, M.I. Problems in computational geometry. Dep. Comptr. Sci., Yale U., New Haven, Conn., May 1975.
10. Sklansky, J. Measuring concavity on a rectangular mosaic, IEEE Trans. Comptrs. C-21 (Dec. 1972), 1355-1364.
11. Yao, F.F. On finding the maximal elements in a set of plane vectors. Comptr. Sci. Dep. Rep., U. of Illinois at Urbana-Champaign, Urbana, III., July 1974.