Partitioning a polygon into congruent pieces

Dania El-Khechen

In this talk, I will present a polynomial time algorithm for partitioning a polygon into two (proper or mirror) congruent pieces. I will conclude with some conjectures and open problems. This is a joint work with John Iacono, Thomas Fevens and Gunter Rote.