# Smallest Circle Problem

Smallest Circle Problem

The smallest circle problem for a set of two-dimensional points seeks to find the smallest-radius circle that contains all the points. This Demonstration uses the Matoušek, Sharir and Welzl (MSW) algorithm [1] that computes the circle for points in expected time. Move the locators to interact with the solution and use the slider to change the number of points.

n

O(n)

The built-in Wolfram Language function BoundingRegion uses a similar method.