Tiling polygons with parallelograms (Q1184161)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tiling polygons with parallelograms |
scientific article; zbMATH DE number 34172
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tiling polygons with parallelograms |
scientific article; zbMATH DE number 34172 |
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
0 references
0.94504225
0 references
0.93017805
0 references
0.91781276
0 references
0 references
0.9170626
0 references
