Computing the convex hull of a set of points

Published: 1 January 1987| Version 1 | DOI: 10.17632/8fwty82ddj.1
D.C.S. Allison, M.T. Noga


Abstract Title of program: CXHULL Catalogue number: AATI Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland (see application form in this issue) Computer: VAX 8600; Installation: Lockheed Palo Alto Research Labs. Operating system: VMS Version 4.2 Programming language used: Fortran 77 High speed storage required: 8123 words No. of bits in a word: 32 No. of lines in combined program and test deck: 669 Title of program: CXHULL Catalogue Id: AATI_v1_0 Nature of problem The program determines the vertices of the convex hull of a set of points in the (x,y) plane. The convex hull is the minimum area convex polygon which will entirely contain the set. The vertices are output in countrclockwise order beginning with the vertex which has least y- coordinate. Versions of this program held in the CPC repository in Mendeley Data AATI_v1_0; CXHULL; 10.1016/0010-4655(87)90055-5 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018)



Computational Physics, Computational Method