Computing the three-dimensional convex hull

Published: 1 January 1997| Version 1 | DOI: 10.17632/fbgzdjv3xd.1
D.C.S. Allison, M.T. Noga


Abstract The program tetra computes the three-dimensional convex hull of a set of n points in (x, y, z) space. The input consists of the coordinates of the points and the output is the identification numbers of the points that are on the convex hull. Since the convex hull is constructed as a set of triangular faces, called facets, additional output information can be requested about these interlocking facets. This additional information may be used to reconstruct and verify the correctness of the comp... Title of program: tetra Catalogue Id: ADFS_v1_0 Nature of problem The program determines the convex hull of a set of points in (x,y,z) space. The convex hull is the minimum volume convex polytope which encloses the set of points. This polytope can be considered to be composed of a set of triangular faces called facets. The program returns the points on the hull and, if requested, information from a balanced binary tree containing all the facets on the hull. Versions of this program held in the CPC repository in Mendeley Data ADFS_v1_0; tetra; 10.1016/S0010-4655(97)00027-1 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)



Computational Physics, Computational Method