Welzl and Convex Hull algorithms

Welzl algorithm efficiently finds the smallest enclosing circle (in O(n)!).
This optimal circle is show in red, the yellow one being an approximation. The convex hull is shown is blue.