Smallest Circle Problem
The smallest-circle problem or minimum covering circle problem is a mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane. The corresponding problem in n-dimensional space, the smallest bounding-sphere problem, is to compute the smallest n-sphere that contains all of a given set of points. The smallest-circle problem was initially proposed by the English mathematician James Joseph Sylvester in 1857.
The smallest-circle problem in the plane is an example of a facility location problem in which the location of a new facility must be chosen to provide service to a number of customers, minimizing the farthest distance that any customer must travel to reach the new facility. Both the smallest circle problem in the plane, and the smallest bounding sphere problem in any higher-dimensional space of bounded dimension, may be solved in linear time.
Read more about Smallest Circle Problem: Characterization, Linear-time Solutions, Other Algorithms, Weighted Variants of The Problem
Famous quotes containing the words smallest, circle and/or problem:
“There’s not the smallest orb which thou behold’st
But in his motion like an angel sings,
Still quiring to the young-eyed cherubins;
Such harmony is in immortal souls,
But whilst this muddy vesture of decay
Doth grossly close it in, we cannot hear it.”
—William Shakespeare (1564–1616)
“Perchance we may,
Where now this night is day,
And even through faith of still averted feet,
Making full circle of our banishment,
Amazed meet;”
—Coventry Kersey Dighton Patmore (1823–1896)
“The problem for the King is just how strict
The lack of liberty, the squeeze of the law
And discipline should be in school and state....”
—Robert Frost (1874–1963)