actually I think for my problem, constructing the circle from three points should work ... Thanks for this hint!
However, I am also interested in the second way. I will not be dealing with more than 20.000 tiles, so I guess, speed is not a show stopper for the O(n^3) algorithm. Could you quickly describe or show how you implemented it?