Dissecting the square into seven or nine congruent parts

2021/04/11 by Maldonado, Gerardo L., Roldán-Pensado, Edgardo
#Computational Geometry (cs.CG) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.2104.04940

Abstract

We give a computer-based proof of the following fact: If a square is divided into seven or nine convex polygons, congruent among themselves, then the tiles are rectangles.

Related

• 'Congruent Partitions' of Polygons - a Short Introduction
• On Dividing a Rectangle
• Can You Pave the Plane Nicely with Identical Tiles
• A note on tiling with integer-sided rectangles
• Tilings of the Sphere by Congruent Quadrilaterals or Triangles