Tiling polygons with parallelograms (Q1184161): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q238069 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Milan Vlach / rank | |||
Normal rank | |||
Revision as of 11:28, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tiling polygons with parallelograms |
scientific article |
Statements
Tiling polygons with parallelograms (English)
0 references
28 June 1992
0 references
The paper is concerned with partitioning a given simple polygon without holes into parts, each of which is a parallelogram. Necessary and sufficient conditions for such tilability are derived and a polynomial- time algorithm is presented which decides whether such a tiling exists, and, if so, produces one.
0 references
computational geometry
0 references
tilings
0 references
simple polygons
0 references
