Minimum Enclosing Circle

A code to find the minimum circle enclosing a set of given 2d points (Cartesian).

This code takes an input of a set of given (x,y) points in the Cartesian coordinates and returns the center and radius of the minimum circle enclosing the points. The code is not optimized and may have bugs, but for the many cases I tried it seems to work.
The code is written based on the very nice Java applet found here (link not working anymore): http://heyoka.cs.uiuc.edu/~thite/mincircle/
Credit for the code is to author of the applet.