Tiling polygons with parallelograms (Q1184161): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Milan Vlach / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Milan Vlach / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Properties of matroids characterizable in terms of excluded matroids / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangulation and shape-complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposition and intersection of simple splinegons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3772828 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3292914 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangulating Simple Polygons and Equivalent Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3963718 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tiling a polygon with parallelograms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3799261 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Conway's Tiling Groups / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:01, 15 May 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
