Algorithm Modification

[dliebner]

Wondering if I can pick someone's brain here... I need an algorithm very similar to this one but different. I'd like to find the location and radius of the largest inscribed circle to intersect the polygon, allowing for holes and gaps within the polygon/intersected circle, with an arbitrary coverage requirement. For example, a 90% coverage requirement would mean the circle's area must be at least 90% covered by the polygon. A 100% coverage requirement would be identical to this algorithm (I believe). In any case, I want the circle to remain inscribed by the outer points of the polygon. Any ideas how I might modify this algorithm to accomplish this goal?

Edit: I guess I could just do a concave hull transformation on the original polygon first, and then run the polylabel algorithm on the resulting polygon?

[dliebner]

The concave hull transformation technique seems to work! You learn something new every day.