Tiling Polyominoes with Squares that Touch the Boundary

by    A. Spillner

Preprint series: 04-10, Reports on Computer Science

68U05 Computer graphics; computational geometry [See also 65D18]
65D18 Computer graphics and computational geometry [See also 51N05, 68U05]

Abstract: We study the problem of tiling a polyomino \(P\) with
squares such that every square in the tiling has a
nonempty intersection with the boundary of \(P\).
We are especially interested in tilings with a minimum
number of squares and in efficient algorithms to find
such tilings.

Keywords: polyomino, tiling

Upload: 2004-09-02

The author(s) agree, that this abstract may be stored as full text and distributed as such by abstracting services.