Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Thank you! I have some doubts, doesn't the diagonal of the leftmost rectangle always intersect $F$? Also could you please provide more details why the procedure stops after a finite number of steps?
Thanks for the reference. However in this problem it's assumed that this specific simple polygon $P$ can be tiled with parallelograms. It's an initial condition.