Not every simple polygon can be tiled with parallelograms.
Kannan, Sampath, and Danny Soroker. "Tiling polygons with parallelograms." Discrete & Computational Geometry 7, no. 2 (1992): 175-188. DOI.
Kenyon, Richard. "Tiling a polygon with parallelograms." Algorithmica 9, no. 4 (1993): 382-397. DOIDOI.
Here are two untilable examples from the Kannan et al. paper:
Not every simple polygon can be tiled with parallelograms.
Kannan, Sampath, and Danny Soroker. "Tiling polygons with parallelograms." Discrete & Computational Geometry 7, no. 2 (1992): 175-188. DOI.
Kenyon, Richard. "Tiling a polygon with parallelograms." Algorithmica 9, no. 4 (1993): 382-397. DOI.
Here are two untilable examples from the Kannan et al. paper:
Not every simple polygon can be tiled with parallelograms.
Kannan, Sampath, and Danny Soroker. "Tiling polygons with parallelograms." Discrete & Computational Geometry 7, no. 2 (1992): 175-188. DOI.
Kenyon, Richard. "Tiling a polygon with parallelograms." Algorithmica 9, no. 4 (1993): 382-397. DOI.
Here are two untilable examples from the Kannan et al. paper:
Not every simple polygon can be tiled with parallelograms.
Kannan, Sampath, and Danny Soroker. "Tiling polygons with parallelograms." Discrete & Computational Geometry 7, no. 2 (1992): 175-188. DOI.
Kenyon, Richard. "Tiling a polygon with parallelograms." Algorithmica 9, no. 4 (1993): 382-397. DOI.
Here are two untilable examples from the Kannan et al. paper:
Not every simple polygon can be tiled with parallelograms.
Kannan, Sampath, and Danny Soroker. "Tiling polygons with parallelograms." Discrete & Computational Geometry 7, no. 2 (1992): 175-188.
Kenyon, Richard. "Tiling a polygon with parallelograms." Algorithmica 9, no. 4 (1993): 382-397.
Here are two untilable examples from the Kannan paper:
Not every simple polygon can be tiled with parallelograms.
Kannan, Sampath, and Danny Soroker. "Tiling polygons with parallelograms." Discrete & Computational Geometry 7, no. 2 (1992): 175-188. DOI.
Kenyon, Richard. "Tiling a polygon with parallelograms." Algorithmica 9, no. 4 (1993): 382-397. DOI.
Here are two untilable examples from the Kannan et al. paper:
Not every simple polygon can be tiled with parallelograms.
Kannan, Sampath, and Danny Soroker. "Tiling polygons with parallelograms." Discrete & Computational Geometry 7, no. 2 (1992): 175-188.
Kenyon, Richard. "Tiling a polygon with parallelograms." Algorithmica 9, no. 4 (1993): 382-397.
Here are two untilable examples from the Kannan paper:
