3 ms·
There appears to be an O(n log n) algorithm: https://stackoverflow.com/questions/4279478/largest-circle-inside-a-non-convex-polygon/46867645#46867645 https://st
by yorwba 8y ago
There 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...