Hopp, T.
and Reeve, C.
(1996),
An Algorithm for Computing the Minimum Covering Sphere in Any Dimension, NIST Interagency/Internal Report (NISTIR), National Institute of Standards and Technology, Gaithersburg, MD, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=821177
(Accessed October 31, 2024)
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 (0Citation
NIST Interagency/Internal Report (NISTIR) - 5831
Report Number
5831
NIST Pub Series
Pub Type
NIST Pubs
Download Paper
Keywords
algorithm, computational geometry, covering sphere, minimax fit, minimum covering sphere, surface fitting
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created December 31, 1995, Updated October 12, 2021