How to find the largest circle that fits inside a simple planar polygon?

268 Views Asked by At

Given a 2D simple polygon with $n$ vertices, how would I find the largest circle (whose centre and radius are unknown) that fits inside (circle can be tangent to edges/coincident with vertices) the polygon? Is there any way to solve this analytically as opposed to algorithmically?

1

There are 1 best solutions below

2
On

I guess you could mix analytic and algorithmic. The maximiser circle will necessarily be constrained by three conditions which could be either "containing a vertex" or "being tangent to one of the edges". So you could iterate over each of the $\binom {2n} 3$ possible sets of three constraints, translate those into systems of equations, and solve them, throw out solutions that are not actually inscribed, and then maximise radius...