Results 81 to 90 of about 1,340 (226)
Total Independent Set Numbers on Catacondensed Polyomino Systems
, 2021 A catacondensed polyomino system is a chain polyomino system in which the joining of the centers of its adjacent cells forms a tree. Total independent set number is a graph invariant that has been studied extensively in statistical mechanics and ...
Haizhen Ren, Dong Zhu, Deqing Xu
semanticscholar +1 more source
On the generation of convex polyominoes
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On the Generation of 2-Polyominoes [PDF]
, 2018 The class of 2-polyominoes contains all polyominoes P such that for any integer i, the first i columns of P consist of at most 2 polyominoes. We provide a decomposition that allows us to exploit suitable discrete dynamical systems to define an algorithm for generating all 2-polyominoes of area n in constant amortized time and space O(n).
Enrico Formenti, Paolo Massazza
openaire +2 more sources
On word-representability of polyomino triangulations
, 2015 A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $(x,y)$ is an edge in $E$. Some graphs are word-representable, others are not. It is known that a graph
Masarova, Z., Akrobotu, P., Kitaev, S.
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
Motion planner for a Tetris-inspired reconfigurable floor cleaning robot
International Journal of Advanced Robotic Systems, 2020 Coverage path planning technique is an essential ingredient in every floor cleaning robotic systems. Even though numerous approaches demonstrate the benefits of conventional coverage motion planning techniques, they are mostly limited to fixed ...
Prabakaran Veerajagadheswar +4 more
doaj +1 more source
Enumeration of minimal 3D polyominoes inscribed in a rectangular prism [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We consider the family of 3D minimal polyominoes inscribed in a rectanglar prism. These objects are polyominos and so they are connected sets of unitary cubic cells inscribed in a given rectangular prism of size $b\times k \times h$ and of minimal volume
Alain Goupil, Hugo Cloutier
doaj +1 more source
Binomials Arising from Buchberger Algorithm on Polyomino Ideals
European Journal of Pure and Applied MathematicsA polyomino is a finite set of unit squares joined side by side on the Cartesian plane. Qureshi introduced an ideal constructed from a polyomino which is called "polyomino ideal". In this paper, we study the binomials arising from Buchberger Algorithm on
Yoshua Hamonangan, I. Muchtadi-Alamsyah
semanticscholar +1 more source
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