A note on tiling with integer-sided rectangles

DOI10.1006/JCTA.1996.0053zbMATH Open0846.05019arXivmath/9411216OpenAlexW2042396901MaRDI QIDQ1914014FDOQ1914014

Authors: Richard Kenyon 

Publication date: 9 July 1996

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.

Full work available at URL: https://arxiv.org/abs/math/9411216

Recommendations

• Fourteen Proofs of a Result About Tiling a Rectangle
• scientific article; zbMATH DE number 1256699
• Algorithms – ESA 2004
• Tiling a polygon with two kinds of rectangles
• Tiling with Squares and Anti-Squares

zbMATH Keywords

algorithmtilingrectanglerectilinear polygon

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45)

Cited In (20)

• Tiling a Manhattan Polyomino with Bars
• Optimal Partial Tiling of Manhattan Polyominoes
• Tilted corners in integer grids
• A note on perfect tilings of rectangles with rectangles
• Generalizing the divisibility property of rectangle domino tilings
• Ribbon tile invariants from the signed area
• On tilings by ribbon tetrominoes
• Ribbon tile invariants
• Tilings of orthogonal polygons with similar rectangles or triangles
• Ribbon tilings and multidimensional height functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)