I,m looking for an algorithm that would take a closed orthogonal polygon
with given x,y coordinates and return a set of rectangles(x,y coordinates).
If possible it would find the biggest rectange first.
simple graphical example :
__________
| |_____
| |
| |
|______________ |
Would return
__________
| | ______
| | | |
| | | |
|_________ | |_____ |
Regards,
Warren