Live briefing
Everything about Smallest-circle problem
Finding the smallest circle that contains all given points
The smallest-circle problem is a computational geometry 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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Smallest-circle problemA 5-minute orientation
- Pick up a classic book: American FilmThe most-reprinted book on the subject
- Read the landmark paper: Solution Methodologies for the Smallest Enclosing Circle ProblemCited 67 times
- Go sideways: Bounding sphereA closely related topic
- Go sideways: LP-type problemA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Solution Methodologies for the Smallest Enclosing Circle Problem
Computing the smallest k-enclosing circle and related problems
An efficient cutting plane algorithm for the smallest enclosing circle problem
A reformulation-linearization based algorithm for the smallest enclosing circle problem
Solving Smallest Enclosing Circle Problem by Wading across Stream Algorithm
📚 Books worth reading
American FilmAmerican Film Institute · 1975
Foundations of computer scienceBehrouz A. Forouzan · 2002
Awareness Techniques by William SwygardWilliam Swygard · 1971
A TOUR OF THE WORLDMalik Mansab Khan, Muhammad Rafique Abdul Aziz · 2025
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Bounding sphere In mathematics, given a non-empty set of objects of finite extension in d-dimensional space, for example a set of points, a bounding sphere, enclosing…
- LP-type problem In the study of algorithms, an LP-type problem (also called a generalized linear program) is an optimization problem that shares certain properties with…
- Proximity problems Proximity problems is a class of problems in computational geometry which involve estimation of distances between geometric objects. A subset of these…
- Minimum-diameter spanning tree In metric geometry and computational geometry, a minimum-diameter spanning tree of a finite set of points in a metric space is a spanning tree in which…
- 1-center problem The 1-center problem, also known as minimax problem or minmax location problem, is a classical combinatorial optimization problem in operations research…
- Euclidean minimum spanning tree A Euclidean minimum spanning tree of a finite set of points in the Euclidean plane or higher-dimensional Euclidean space connects the points by a system…
- K-set (geometry) In discrete geometry, a k-set of a finite point set S in the Euclidean plane is a subset of k elements of S that can be strictly separated from the remaining…
- Optimal facility location Optimal facility location (OFL), also called location analysis, is a class of optimization problems. In all these problems, the goal is to decide where…