Hopp, T.
and Reeve, C.
(1989),
An Algorithm for Computing the Minimum Covering Sphere in any Dimension, SIAM Journal of Computing
(Accessed April 3, 2025)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
An Algorithm for Computing the Minimum Covering Sphere in any Dimension
Published
Author(s)
, C Reeve
Abstract
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).Citation
SIAM Journal of Computing
Pub Type
Journals
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created December 31, 1988, Updated October 12, 2021