WOLFRAM|DEMONSTRATIONS PROJECT

Smallest Circle Problem

โ€‹
number of points
100
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
n
points in expected
O(n)
time. Move the locators to interact with the solution and use the slider to change the number of points.
The built-in Wolfram Language function BoundingRegion uses a similar method.