January 1, 1989
Author(s)
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