Results 61 to 70 of about 920 (172)
“Deco” polyominoes, permutations and random generation
, 1996 In this paper, we introduce a class of polyominoes, called deco polyominoes, in bijection with the set of permutations of the first k integers. We evaluate some typical parameters for this class of polyominoes and define a linear algorithm for randomly ...
Pinzani, Renzo +2 more
core +1 more source
Detection of the Discrete Convexity of Polyominoes [PDF]
Discrete Applied Mathematics, 2000 The convexity of a discrete region is a property used in numerous domains of computational imagery. We study its detection iu the particular case of polyominoes. We present a first method, directly relying on its definition. A second method, which is based on techniques for segmentation of curves in discrete lines, leads to a very simple algorithm ...
Debled-Rennesson, Isabelle +2 more
openaire +4 more sources
Tiling with sets of polyominoes
, 1970 The definitions and lattice hierarchy previously established for tiling regions with individual polyominoes are extended to finite sets of polyominoes. The problem of tiling the infinite plane with replicas of a finite set of polyominoes is proved to be ...
Golomb, Solomon W.
core +1 more source
CoRR, 2023 A locked $t$-omino tiling is a grid tiling by $t$-ominoes such that, if you remove any pair of tiles, the only way to fill in the remaining $2t$ grid cells with $t$-ominoes is to use the same two tiles in the exact same configuration as before. We exclude degenerate cases where there is only one tiling overall due to small dimensions.
openaire +2 more sources
On the number of hexagonal polyominoes
Theoretical Computer Science, 2003 A combination of the refined finite lattice method and transfer allows a radical increase in the computer enumeration of polyominoes on the hexagonal lattice (equivalently, site clusters on the triangular lattice), \(p_n\), with \(n\) hexagons. In this paper the authors obtain \(p_n\) for \(n\leq 35\).
Markus Vöge, Anthony J. Guttmann
openaire +2 more sources
Succession rules and Deco polyominoes [PDF]
RAIRO - Theoretical Informatics and Applications, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BARCUCCI, ELENA +2 more
openaire +3 more sources
Properties of Minimal-Perimeter Polyominoes (Multimedia Exposition)
, 2019 In this video, we survey some results concerning polyominoes, which are sets of connected cells on the square lattice, and specifically, minimal-perimeter polyominoes, that are polyominoes with the minimal-perimeter from all polyominoes of the same ...
Ben-Shachar, Gil, Barequet, Gill
core +1 more source
Folding Polyominoes into (Poly)Cubes [PDF]
International Journal of Computational Geometry & Applications, 2018 We study the problem of folding a polyomino [Formula: see text] into a polycube [Formula: see text], allowing faces of [Formula: see text] to be covered multiple times. First, we define a variety of folding models according to whether the folds (a) must be along grid lines of [Formula: see text] or can divide squares in half (diagonally and/or ...
Oswin Aichholzer +8 more
openaire +8 more sources
Counting polyominoes: Yet another attack
, 1981 A polyomino is a connected collection of squares on an unbounded chessboard. There is no known formula yielding the number of distinct polyominoes of a given number of squares A polyomino enumeration method, faster than any previous, is presented.
D.Hugh Redelmeier +2 more
core +1 more source
Computational Geometry, 2014 For a set \(D\) of polyominoes, a packing of the plane with \(D\) is a maximal set of copies of polyominoes from \(D\) that are non overlapping. \textit{A. Gyárfás} et al. [Discrete Math. 71, No. 1, 33--46 (1988; Zbl 0663.05021)] called a set of disjoint polyominoes a clumsy packing if no other polyomino can be added without an overlap and the total ...
Stefan Walzer +2 more
openaire +2 more sources