A brute-force approach might be to start with an n-sided polygon (regular, I assume) circumscribed around the minimum enclosing circle, and then proceed to incrementally rotate the polygon and decrease the radius until the polygon intersects the enclosed objects for each rotation step.
Of course, given the symmetry of the polygon, you would only need to perform a rotation through pi/n radians.