The minimal enclosing circle problem is the optimization problem of finding the minimal enclosing circle of a given finite
set of points. Equivalently, it asks for a center 
and the smallest radius 
such that every input point 
satisfies 
. The problem is also called the smallest circle
problem or bomb problem.
Minimal Enclosing Circle Problem
See also
Enclosing Circle, Minimal Enclosing CircleExplore with Wolfram|Alpha
References
Megiddo, N. "Linear-Time Algorithms for Linear Programming in
and Related Problems." SIAM J. Comput. 12, 759-776, 1983.Preparata,
F. R. and Shamos, M. I. Computational
Geometry: An Introduction. New York: Springer-Verlag, 1985.Referenced on Wolfram|Alpha
Minimal Enclosing Circle ProblemCite this as:
Weisstein, Eric W. "Minimal Enclosing Circle Problem." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/MinimalEnclosingCircleProblem.html