The tile packing problem is a challenging combinatorial puzzle based on tiles with colored edges or colored corners. In its different incarnations, the puzzle gives rise to a number of interesting problems. In this paper, we sketch the background of the tile packing problem and present solutions to the puzzle. We hope that this work will stimulate further interest in this puzzle amongst readers, and that the remaining open problems will eventually be solved.status: publishe
International audienceThis paper deals with the packing of square tiles of the same size into one te...
For finite polyomino regions, tileability by a pair of rectangles is NP-complete for all but trivial...
Discrete tomography deals with reconstructing finite spatial objects from their projections. The obj...
The tile packing problem is a challenging combinatorial puzzle based on tiles with colored edges or ...
The Co-printing Problem is a new type of packing problem. It finds its origin in the printing of Tet...
Combinatorics is the field of mathematics studying the combination and permutation of sets of elemen...
The design of building construction parts often means design synthesis: complex parts will be genera...
) 1 Introduction We study several rectangle tiling and packing problems. These are natural combina...
This thesis was completed and submitted at Nipissing University, and is made freely accessible throu...
The thesis represents a collection of solved problems concerned with covering planar shapes (mostly ...
Cutting and packing problems have been a core area of research for many decades. Irregular shape pac...
Analysis of AlgorithmsWe consider questions concerning the tileability of orthogonal polygons with c...
This work presents novel methods to address two problems. One is synthesizing digital mosaic art ove...
Tiling models are classical statistical models in which different geometric shapes, the tiles, are p...
Cutting and packing problems have been a core area of research for many decades. Irregular shape pac...
International audienceThis paper deals with the packing of square tiles of the same size into one te...
For finite polyomino regions, tileability by a pair of rectangles is NP-complete for all but trivial...
Discrete tomography deals with reconstructing finite spatial objects from their projections. The obj...
The tile packing problem is a challenging combinatorial puzzle based on tiles with colored edges or ...
The Co-printing Problem is a new type of packing problem. It finds its origin in the printing of Tet...
Combinatorics is the field of mathematics studying the combination and permutation of sets of elemen...
The design of building construction parts often means design synthesis: complex parts will be genera...
) 1 Introduction We study several rectangle tiling and packing problems. These are natural combina...
This thesis was completed and submitted at Nipissing University, and is made freely accessible throu...
The thesis represents a collection of solved problems concerned with covering planar shapes (mostly ...
Cutting and packing problems have been a core area of research for many decades. Irregular shape pac...
Analysis of AlgorithmsWe consider questions concerning the tileability of orthogonal polygons with c...
This work presents novel methods to address two problems. One is synthesizing digital mosaic art ove...
Tiling models are classical statistical models in which different geometric shapes, the tiles, are p...
Cutting and packing problems have been a core area of research for many decades. Irregular shape pac...
International audienceThis paper deals with the packing of square tiles of the same size into one te...
For finite polyomino regions, tileability by a pair of rectangles is NP-complete for all but trivial...
Discrete tomography deals with reconstructing finite spatial objects from their projections. The obj...