I am in the middle of a process of implementation of Fortune's algorithm for a Voronoi diagram generating on a plane. Here the last C++ debug version. Very rarely I catch (visually) such a bugs:
Debugging process of a geometrical algorithms considered very complex by me. I even don't know which runtime checks (
assert-ions) should I add to catch this bugs on the fly.
The question is addressed to those who have tried to implement Fortune's algorithm. I sure, if one faced similar bugs in his implementation somewhere in the middle of a way, then one may remember how to avoid it.
What is the source of the bug? What is the main corner cases (except rectangle mesh, concentric points, etc) can I face?