Does anyone know an algorithm to solve the following problem:
Given a sequence of points in the plane that represent a polygon (not necessarily convex), output the maximum possible radius of a circle that can fit inside this polygon.
It would be good if it was below O(n2), but any code is welcome. Thanks ahead.