论文信息 - An Algorithm for Computing the Minimum Covering Sphere in Any Dimension

An Algorithm for Computing the Minimum Covering Sphere in Any Dimension

An algorithm ispresented for computing theminimum covering spherefor aset of n points in d-dimensional space(0 < n, d < ). Thestepsof thegeometric construction can readily beprogrammed for acomputer. In theworst case, with all thepoints near thespheresurface, theexpected computing time is estimated at O(nd ). 2.3

T. Hopp | C. Reeve

[1] J. Sylvester. XXVII. On Poncelet's approximate linear Valuation of surd forms , 1860 .

[2] Mervin E. Muller,et al. A note on a method for generating points uniformly on n-dimensional spheres , 1959, CACM.

[3] C. Groenewoud,et al. The Smallest Covering Cone or Sphere , 1963 .

[4] D. Hearn,et al. The Minimum Covering Sphere Problem , 1972 .

[5] G. Stewart. Introduction to matrix computations , 1973 .

[6] Gene H. Golub,et al. Matrix computations , 1983 .

[7] Martin E. Dyer,et al. Linear Time Algorithms for Two- and Three-Variable Linear Programs , 1984, SIAM J. Comput..

[8] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .