AbstractThis paper is on tilings of polygons by rectangles. A celebrated physical interpretation of such tilings by R.L. Brooks, C.A.B. Smith, A.H. Stone and W.T. Tutte uses direct-current circuits. The new approach of this paper is an application of alternating-current circuits. The following results are obtained:•a necessary condition for a rectangle to be tilable by rectangles of given shapes;•a criterion for a rectangle to be tilable by rectangles similar to it but not all homothetic to it;•a criterion for a “generic” polygon to be tilable by squares. These results generalize those of C. Freiling, R. Kenyon, M. Laczkovich, D. Rinne, and G. Szekeres
Analysis of AlgorithmsWe consider questions concerning the tileability of orthogonal polygons with c...
AbstractLet T be a tile made up of finitely many rectangles whose corners have rational coordinates ...
For finite polyomino regions, tileability by a pair of rectangles is NP-complete for all but trivial...
This paper is on tilings of polygons by rectangles. A celebrated physical interpretation of such til...
This article shines new light on the classical problem of tiling rectangles with squares efficiently...
We study the problem of tiling a simple polygon of surface n with rectangles of given types (tiles)....
We present a new type of polyominoes that can have transparent squares (holes). We show how these po...
AbstractWe show how to determine if a given rectilinear polygon can be tiled with rectangles, each h...
We fix two rectangles with integer dimensions. We give a quadratic time algorithm which, given a pol...
In this work, we focus on Tiling by rectangles, its Connectivity and associated Covariants. Tiling b...
This paper shows how a method developed by Van Steenwijk can be generalized to calculate the resista...
Abstract. Does a given a set of polyominoes tile some rectangle? We show that this problem is undeci...
We explore a special class of regular 3D polygonal circuits, that is, of regular non-planar polygons...
The thesis represents a collection of solved problems concerned with covering planar shapes (mostly ...
If a finite number of rectangles, every one of which has at least one integer side, perfectly tile a...
Analysis of AlgorithmsWe consider questions concerning the tileability of orthogonal polygons with c...
AbstractLet T be a tile made up of finitely many rectangles whose corners have rational coordinates ...
For finite polyomino regions, tileability by a pair of rectangles is NP-complete for all but trivial...
This paper is on tilings of polygons by rectangles. A celebrated physical interpretation of such til...
This article shines new light on the classical problem of tiling rectangles with squares efficiently...
We study the problem of tiling a simple polygon of surface n with rectangles of given types (tiles)....
We present a new type of polyominoes that can have transparent squares (holes). We show how these po...
AbstractWe show how to determine if a given rectilinear polygon can be tiled with rectangles, each h...
We fix two rectangles with integer dimensions. We give a quadratic time algorithm which, given a pol...
In this work, we focus on Tiling by rectangles, its Connectivity and associated Covariants. Tiling b...
This paper shows how a method developed by Van Steenwijk can be generalized to calculate the resista...
Abstract. Does a given a set of polyominoes tile some rectangle? We show that this problem is undeci...
We explore a special class of regular 3D polygonal circuits, that is, of regular non-planar polygons...
The thesis represents a collection of solved problems concerned with covering planar shapes (mostly ...
If a finite number of rectangles, every one of which has at least one integer side, perfectly tile a...
Analysis of AlgorithmsWe consider questions concerning the tileability of orthogonal polygons with c...
AbstractLet T be a tile made up of finitely many rectangles whose corners have rational coordinates ...
For finite polyomino regions, tileability by a pair of rectangles is NP-complete for all but trivial...