A note on tiling with integer-sided rectangles
From MaRDI portal
Abstract: We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.
Recommendations
Cited in
(20)- Tiling a Manhattan Polyomino with Bars
- Optimal Partial Tiling of Manhattan Polyominoes
- A note on perfect tilings of rectangles with rectangles
- Tilted corners in integer grids
- Generalizing the divisibility property of rectangle domino tilings
- Ribbon tile invariants from the signed area
- On tilings by ribbon tetrominoes
- Tilings of orthogonal polygons with similar rectangles or triangles
- Ribbon tile invariants
- Ribbon tilings and multidimensional height functions
- scientific article; zbMATH DE number 2100932 (Why is no real title available?)
- scientific article; zbMATH DE number 6670068 (Why is no real title available?)
- scientific article; zbMATH DE number 7298071 (Why is no real title available?)
- Algorithms – ESA 2004
- Tiling with Squares and Anti-Squares
- POSSIBILITIES AND IMPOSSIBILITIES IN SQUARE-TILING
- Tile invariants: New horizons.
- On the number of tiles visited by a line segment on a rectangular grid
- Fourteen Proofs of a Result About Tiling a Rectangle
- Tiling a polygon with two kinds of rectangles
This page was built for publication: A note on tiling with integer-sided rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1914014)
