'Congruent Partitions' of Polygons - a Short Introduction

TL;DR

This paper introduces the problem of partitioning convex polygons into mutually congruent pieces, discussing its significance and potential approaches in computational geometry.

Contribution

It presents the concept of congruent partitions of polygons and provides a brief overview of related problems and methods.

Findings

Defines the problem of polygon congruent partitions

Highlights challenges in partitioning convex regions

Suggests potential applications in design and tiling

Abstract

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