Results 91 to 100 of about 1,340 (226)
Odd order C₄-face-magic projective grid graphs
Electronic Journal of Graph Theory and ApplicationsFor a graph G = (V, E) embedded in the projective plane, let F(G) denote the set of faces of G. Then, G is called a Cₙ-face-magic projective graph if there exists a bijection f: V(G) → {1, 2, …, |V(G)|} such that for any F ∈ F(G) with F ≅ Cₙ, the sum of ...
Stephen James Curran
doaj +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
IEEE Access, 2020 Floor cleaning robots have been developed to cope with the issues arisen with conventional cleaning methods that involve extensive human labor. hTetro is a self-reconfigurable floor cleaning robot that has been introduced to improve area coverage ...
M. A. Viraj J. Muthugala +2 more
doaj +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
Tessellating polyominos in the plane
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ming-You Chen +2 more
openaire +2 more sources
Permutation classes and polyomino classes with excluded submatrices
, 2017 This article introduces an analogue of permutation classes in the context of polyominoes. For both permutation classes and polyomino classes, we present an original way of characterizing them by avoidance constraints (namely, with excluded submatrices ...
Battaglino, Daniela +3 more
core +1 more source
Polyomino tilings, cellular automata and codicity
, 1995 As usual, a 4-connex finite part of Z2 is called a polyomino. Recognizing whether a given polyomino can be tiled by translated copies of tiles taken from a given family of polyominoes is obviously decidable.
Beauquier, Daniéle, Aigrain, Philippe
core +1 more source
Polyomino-Based Digital Halftoning
, 2008 International audienceIn this work, we present a new method for generating a threshold structure. This kind of structure can be advantageously used in various halftoning algorithms such as clustered-dot or dispersed-dot dithering, error diffusion with ...
Vanderhaeghe, David +1 more
core
Common Unfoldings of Polyominoes and Polycubes [PDF]
, 2011 This paper studies common unfoldings of various classes of polycubes, as well as a new type of unfolding of polyominoes. Previously, Knuth and Miller found a common unfolding of all tree-like tetracubes. By contrast, we show here that all 23 tree-like pentacubes have no such common unfolding, although 22 of them have a common unfolding. On the positive
Greg Aloupis +9 more
openaire +4 more sources
WILD POLYOMINO WEAK (1, 2)-Achievement Games
, 2008 A version of polyomino achievement games is studied, in which the first player marks one and the second player marks two cells at each move. A wild polyomino is a finite set of cells that are connected through an edge or through a corner.
Nándor Sieben
core