'Congruent Partitions' of Polygons - a Short Introduction

2010/01/31 by R. Nandakumar, Ratna Nandakumar, Nandakumar, R.
Computer Science · Materials Science · Mathematics · #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #FOS: Mathematics #Quasicrystal Structures and Properties #math.CO

paper · pdf · doi:10.48550/arxiv.1002.0122

5 pages, 1 figure

openalex publication_date 2010/01/31 · arxiv created 2010/07/31 · arxiv updated 2010/08/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We introduce the problem of partitioning 2D regions (usually convex regions) into mutually congruent pieces ('tiles').

Related

• Cutting Mutually Congruent Pieces from Convex Regions
• Dissecting the square into seven or nine congruent parts
• A Set of Questions in Combinatorial and Metric Geometry
• Convex fair partitions into an arbitrary number of pieces
• Minimum Partition of Polygons under Width and Cut Constraints