Weltzl's Minimal Enclosing Circle (and Sphere)

An extremely cool recursive algortihm for solving the problem of finding the smallest circle (or sphere in 3D) that surrounds all the points in the given dataset. What intrigued me is that, while the complexity of an easy to envision brute force is O(N^4), this algorithm achieves it in only O(N) !!!