I need a function where the input is a list of points that represent a polygon and the output is a list of 4 points that represent the biggest rectangle that fits inside the original polygon. Does anybody know an existing function for that?
There's nothing built-in to do this. I was chatting about this with my team, and I'm not sure a general algorithm to find the largest rectangle within an arbitrary polygon is that easy. There may be multiple solutions for a start, and it could be that the points of the rectangle don't coincide with any points in the polygon. So the simple answer is I'm not aware of anything to do this, or even an algorithm to compute this. I did a quick google search too, and there are a number of papers and discussions on this - like this for example. Of course, if there are some specific constraints on this rectangle or on the polygon - then a simpler method may be possible. Either way, there's no built-in function for this AFAIK.