An Algorithm for Computing the Minimum Covering Sphere in any Dimension
Ted Hopp, C Reeve
An algorithm is presented for computing the minimum covering sphere for a set of n points in d-dimensional space (0 < n, d < oo). The steps of the simple geometric construction can readily be programmed for a computer. In the worst case, with all the points near the sphere surface, the expected computing time is estimated to be 0(nd2.3).
SIAM Journal of Computing
and Reeve, C.
An Algorithm for Computing the Minimum Covering Sphere in any Dimension, SIAM Journal of Computing
(Accessed June 2, 2023)