Cutting polygons composed of equal rectangles into similar rectangles
From MaRDI portal
\textit{M. Dehn} [Math. Ann. 57, 314--332 (1903; JFM 34.0547.02)] proved his famous result that a rectangle can be cut into squares if and only if the ratio of the sides of the rectangle is a rational number. One can consider the general and very complicated problem of cutting a polygon into similar rectangles. The author treats the particular case of cutting a polygon all of whose sides belong to \(\mathbb Q[\sqrt{p}]=\{a+b\sqrt{p}:a, b \in\mathbb Q\}\), where \(p\) is a quadratic irrationality.
Recommendations
Cites work
Cited in
(8)- Cutting rectangles avoiding rectangular defects
- Tiling a square with similar rectangles
- Cutting circles into equal area pieces
- Cutting Polyominos into Equal-Area Triangles
- Cutting Corners: A Four-gon Conclusion
- Dividing a polygon into two similar polygons
- Superport networks
- Transformations of 2-port networks and tiling by rectangles
This page was built for publication: Cutting polygons composed of equal rectangles into similar rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2063655)