Looking for a fun challenge? How about this one. Write an algorithm for finding the minimal circle that will just enclose a set of circles of random radii and random centers. You are not allowed to approximate the circles with points but must use the circle data. Of course we assume that all the circles lie on the XY-plane.
Similar to an Apollonian Gasket, but the internal circles can intersect each other?
Yes, the circles can cross each other. It seems however that everyone is chasing the nearest point now, a separate challenge for another day?