论文部分内容阅读
研究求包含空间中给定的若干个点的最小凸多面体的算法.给出了一种算法,其平均计算时间复杂度为空间中给定点的数量的线性函数
We study the algorithm of finding the smallest convex polyhedron containing a few points given in space. An algorithm is given, whose average computation time complexity is a linear function of the number of given points in space