Computing the three-dimensional convex hull

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)

摘要
该程序tetra计算在(x, y, z)空间中n个点的三维凸包。输入由点的坐标组成，输出为位于凸包上的点的标识号。由于凸包是由称为面的三角形面构成的集合，因此可以请求关于这些相互连接的面的附加输出信息。这些附加信息可用于重建和验证计算的正确性。

程序名称：tetra
目录编号：ADFS_v1_0

问题性质
该程序确定(x, y, z)空间中点的凸包。凸包是包围点集的最小体积凸多面体。该多面体可以被视为由称为面的三角形面组成的集合。程序返回凸包上的点，如果请求，则返回包含凸包上所有面的平衡二叉树中的信息。

CPC存储库中持有的此程序版本
ADFS_v1_0; tetra; 10.1016/S0010-4655(97)00027-1

该程序已从贝尔法斯特女王大学（1969-2019）持有的CPC程序库中导入。