Tiling a polygon with parallelograms (Q2366227)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Tiling a polygon with parallelograms
scientific article

    Statements

    Tiling a polygon with parallelograms (English)
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    The author devises a quadratic time algorithm determining if a simple polygon admits a tiling by parallelograms, and if so constructing it. It is also shown that the problem is of the same complexity if the tiles must be picked from a fixed set of parallelograms. Three generalizations of the problem (tiling a polygon by a fixed set of triangles or trapezoids, tiling polgyons with holes by parallelograms) are shown to be \(NP\)-complete.
    0 references
    0 references
    0 references
    0 references
    0 references
    computational geometry
    0 references
    quadratic time algorithm
    0 references
    simple polygon
    0 references
    tiling by parallelograms
    0 references
    0 references
    0 references