A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes (Q689920): Difference between revisions

Given a finite set of points \(P\) is a finite-dimensional Euclidean space, an algorithm is given for finding the sphere with the smallest radius which contains all the points of \(P\). Then, given a finite collection of finite sets of points, the authors extend the proposed algorithm in order to find concentric spheres with the smallest sum of radii such that each sphere covers the corresponding set of points. Finite convergence of the algorithms is proved. Finally, some computational results are reported.