|
Organizers |
Hypersphere With Smallest Radius
by
Shyam S. Chadha
University of Wisconsin, Eau Claire, WI-54702, USA
Coauthors: Veena Chadha and Adam Prohovnik
This paper answers a century old question "Find the least circle which shall contain a set of points in the plane" proposed by Sylvseter in 1857. A systematic combinatorics approach is suggested to solve this problem. However, it is shown that a quadratic programming approach leads to an efficient algorithm which solves more general problem of finding the Least Hypersphere which contains a given set of points in n-dimensional space. Numerical example illustrates combinatorial algorithm and quadratic programming algorithm.
Note: Confernce registration for Drs. Shyam
Date received: October 13, 2005
Copyright © 2005 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # carm-69.