求包含三维空间中给定点集最小凸多面体算法研究

Algorithm for a Minimal Convex Dolyhedron to Cover Given Points in 3 Dimensional Space

研究求包含空间中给定的若干个点的最小凸多面体的算法．给出了一种算法。

The paper presents the idea and procedure of the algorithm.The results show that the complexity of the average computing time of the algorithm is a linear function of the number of given points.