1. Computational Geometry: Algorithms and Applicaions,;M. Berg;Springer,1997
2. On the problem to construct the minimum circle enclosing n given points in a plan,;P. Chrystal;in Proceedings of the Edinburgh Mathematical Society,1885
3. Minimal spanning circle of a set of points,;J. Eliosoff;Computer Science: Computational Geometry Project,1998
4. The minimum covering sphere problem,;J. Elzinga;Management Sci.,1972
5. Fast and robust smallest enclosing balls,;B. Gärtner;in Algorithms-ESA' 99:7th Annual European Symposium,1643