A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
复制标题
求多胞形最小覆盖球和多个多胞形最小覆盖同心球的递归算法
DOI：
10.1007/bf03167575
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
Yoshitsugu Yamamoto
中科院分区：
文献类型：
--
作者：
Kazuyuki Sekitani;Yoshitsugu Yamamoto
在给定一般维点集P的情况下，给出了求包含所有点的半径最小的球面的递归算法。对于给定的点集Q(1)，…，Q(L)，我们对算法进行了扩展，使得它能找到半径和最小的同心球体，使得每个球体都覆盖相应的点集。
Given a point setPof the general dimension we present a recursive algorithm for finding the sphere with the smallest radius which contains all points ofP. For given point setsQ(1), …,Q(l)we extend the algorithm so that it findslconcentric spheres with the smallest sum of radii such that each sphere covers the corresponding point set.