Splitting a Polygon into Two Congruent Pieces

DOI10.2307/2974930zbMATH Open0854.05031OpenAlexW4239764801MaRDI QIDQ4886432FDOQ4886432

Authors: Kimmo Eriksson 

Publication date: 13 January 1997

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2974930

Recommendations

• Algorithms for fair partitioning of convex polygons
• Algorithms for fair partitioning of convex polygons
• On the Optimal Bisection of a Polygon
• Fair partitions of polygons: an elementary introduction
• scientific article; zbMATH DE number 1159075

zbMATH Keywords

puzzleconvex polygonsplittingpolygonrotational symmetrycongruent connected piecescongruent pieces

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Cited In (2)

• Crazy-cuts: from theory to app
• Dividing a polygon into two similar polygons

This page was built for publication: Splitting a Polygon into Two Congruent Pieces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886432)