bomb problem | minimal enclosing circle problem | smallest circle

The minimal enclosing circle problem, sometimes also known as the bomb problem or smallest circle problem, is the problem of finding the circle of smallest radius that contains a given set of points in its interior or on its boundary. This smallest circle is known as the minimal enclosing circle. Jung's theorem states that every finite set of points with geometric span d has an enclosing circle with radius no greater than d/sqrt(3). The minimal enclosing circle of a set of points can be found in the Wolfram Language using BoundingRegion[pts, MinDisk].

circle | circumcircle | disk | enclosing circle | Jung's theorem | obtuse triangle

BoundingRegion