3 ms·
I can think of computationally intensive probabilistic algorithms to find these circles (e.g. hill-climbing by randomly mutating circles), but is there a way to
by mkl 8y ago
I can think of computationally intensive probabilistic algorithms to find these circles (e.g. hill-climbing by randomly mutating circles), but is there a way to guarantee optimality? I.e. find the absolute largest circle inside a given polygon.
Is there any information about how these particular circles were generated?
- yorwba 8y agoThere appears to be an O(n log n) algorithm: https://stackoverflow.com/questions/4279478/largest-circle-inside-a-non-convex-polygon/46867645#46867645 https://stackoverflow.com/questions/4279478/largest-circle-i...