CONVEX_HULL - A Pascal program for determining the convex hull for planar sets

Computers and Geosciences

Volumn 23, Issue 7, 1997, Pages 725-738

  Yamamoto, Jorge Kazuo ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Algorithms; Complexity; Computational geometry; Convex hull

Indexed keywords

ALGORITHM; COMPUTATIONAL GEOMETRY; COMPUTER PROGRAM; CONVEX HULL; PASCAL; PASCALE;

EID: 0031422242     PISSN: 00983004     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-3004(97)00051-4     Document Type: Article

References (10)

1. Akima, H. (1978) A method of bivariate interpolation and smooth surface fitting for irregularly distributed data points. ACM Trans. Math. Software 4(2), 148-159.
2. Eddy, W. F. (1977) A new convex hull algorithm for planar sets. ACM Trans. Math. Software 3(4), 398-403.
3. Graham, R. L. (1972) An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Lett. 1, 132-133.
4. Jarvis, R. A. (1973) On the identification of the convex hull of a finite set of points in the plane. Information Processing Lett. 2, 18-21.
5. Larkin, B. J. (1991) An ANSI C program to determine in expected linear time the vertices of the convex hull of a set of planar points. Computers & Geosciences 17(3), 431-443.
6. Nievergett, J. and Hinrichs, K. H. (1993) Algorithms & Data Structures - with Applications to Graphics and Geometry. Prentice-Hall Inc., Englewood Cliffs, New Jersey, 350pp.
7. Preparata, F. P. and Hong, S. J. (1977) Convex hull of finite sets of points in two and three dimensions. Comm. ACM 20(2), 87-93.
8. Sedgewick, R. (1983) Algorithms. Addison-Wesley, Reading, Massachusetts, 551pp.
9. Sibson, R. (1978) Locally equiangular triangulations. The Computer Jour. 21(3), 243-245.
10. Wirth, N. (1986) Algorithms and Data Structures. Prentice-Hall Inc., Englewood Cliffs, New Jersey, 288pp.