Tiling a polygon with two kinds of rectangles

DOI10.1007/S00454-005-1173-3zbMATH Open1077.68110OpenAlexW2149217821MaRDI QIDQ2571326FDOQ2571326

Authors: Eric Rémila 

Publication date: 1 November 2005

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-005-1173-3

Recommendations

• Algorithms – ESA 2004
• scientific article; zbMATH DE number 1256699
• scientific article; zbMATH DE number 417272
• Tiling by rectangles and alternating current
• A note on tiling with integer-sided rectangles

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (13)

• Tiling with Squares and Packing Dominos in Polynomial Time
• A note on the structure of spaces of domino tilings
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Tile with Surround Number 2
• Rectangular tileability and complementary tileability are undecidable
• Fast domino tileability
• Algorithms – ESA 2004
• Complexity of tiling a polygon with trominoes or bars
• Tiling polygons with parallelograms
• Families of convex tilings
• Title not available (Why is that?)
• Tile homotopy groups.

This page was built for publication: Tiling a polygon with two kinds of rectangles

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