Sciweavers

25 search results - page 4 / 5
» Tiling a Rectangle with Polyominoes
Sort
View
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 9 months ago
Improved approximation algorithms for rectangle tiling and packing
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly eff...
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, ...
FSTTCS
2006
Springer
13 years 11 months ago
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
Abstract. In this paper we construct fixed finite tile systems that assemble into particular classes of shapes. Moreover, given an arbitrary n, we show how to calculate the tile co...
Florent Becker, Ivan Rapaport, Eric Rémila
ISAAC
2005
Springer
86views Algorithms» more  ISAAC 2005»
14 years 1 months ago
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
Chris Worman, Boting Yang
DNA
2005
Springer
113views Bioinformatics» more  DNA 2005»
14 years 1 months ago
A Self-assembly Model of Time-Dependent Glue Strength
Abstract Self-assembly is a ubiquitous process in which small objects selforganize into larger and complex structures. In 2000, Rothemund and Winfree proposed a Tile Assembly Model...
Sudheer Sahu, Peng Yin, John H. Reif
COMBINATORICS
1998
86views more  COMBINATORICS 1998»
13 years 7 months ago
Lattice Tilings by Cubes: Whole, Notched and Extended
We discuss some problems of lattice tiling via Harmonic Analysis methods. We consider lattice tilings of Rd by the unit cube in relation to the Minkowski Conjecture (now a theorem...
Mihail N. Kolountzakis