3次元空間における有限個の点の高速Convex Hullアルゴリズム

抄録

An efficient convex hull algorithm is presented for finite sets of n points in 3-D space. The method is based on the idea of determining the outline loop of a convex polyhedron viewing from a point and connecting the point with each vertex of the outline loop. A convex hull polyhedron can be constructed with O(n) operations, i. e., the processing time is proportional to the number of given points. The algorithm was programmed in FORTRAN language and various computational results were obtained. They guarantee the justice of the theoretical considerations.