Given three arbitrary, non-overlapping circles, I need to find the smallest circle that encloses all three circles. I need a formula for the non-trivial case, where the enclosing circle touches all three circles.

The radii and the distances and angles between the circles are known. I used the fact that the distances from the center of each circle to the center of the enclosing circle plus the corresponding radius must be equal to the radius of the enclosing circle.
I found a very complex polynomial of degree 4 that assumingly should give me solutions for the radius of the enclosing circle, but I expected a solvable equation that directly gives me the radius.
Any ideas or solutions are appreciated.
I needed an answer to the same problem to assemble bounding circles in collision detection.
so here is how I do it