News for hackers. Stuff that matters.
Re:A new algorithm for finding a visual center of a polygon by Iv on Monday May 22, 2017 @01:08AM (#14391136)
My intuition is that the worst case scenario would be a fractal-like curve with multiple solutions (imagine a snake-like polygon following a Hilbert pattern). In that case the algorithm would need to explore all of the smallest squares, that gives us a higher bound on the number of iterations. It will be far less in most cases.

Would the delaunay-based algorithm be faster in the worst case?

There are no comments on this comment yet.