Given a polygon, how can I find the point inside the polygon, which minimum distance to all corners is the maximum (of all minimum distances of all points inside the polygon)

I hope it‘s clear what I mean. So for one point, you would calculate the distances to all corners, and take the minimum of all these. That would be the minimum distance for one point. And from all the points inside the polygon, I want to find that one, where this minimum distance is maximum. The polygon got infinity points inside, so I can't check them one by one. I need a algorithm which uses the corner of the polygon to find the point I'm searching Add stress words which are capitalized. Limit those stress words for less than 2 times.
user