Results 31 to 40 of about 2,994 (170)
The Estimation of the Number of Lattice Tilings of a Plane by a Given Area Polyomino
Моделирование и анализ информационных систем, 2013 We study a problem of a number of lattice plane tilings by given area polyominoes. A polyomino is a connected plane geometric figure formed by joining edge to edge a finite number of unit squares.
A. V. Shutov, E. V. Kolomeykina
doaj +3 more sources
Tiling a Pyramidal Polycube with Dominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 The notion of pyramidal polycubes, namely the piling-up of bricks of a non-increasing size, generalizes in ℝ n the concept of trapezoidal polyominoes.
Olivier Bodini, Damien Jamet
doaj +2 more sources
Polyominoes determined by permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 In this paper we consider the class of $\textit{permutominoes}$, i.e. a special class of polyominoes which are determined by a pair of permutations having the same size. We give a characterization of the permutations associated with convex permutominoes,
I. Fanti +4 more
doaj +1 more source
Hard and Easy Instances of L-Tromino Tilings [PDF]
, 2020 We study tilings of regions in the square lattice with L-shaped trominoes. Deciding the existence of a tiling with L-trominoes for an arbitrary region in general is NP-complete, nonetheless, we identify restrictions to the problem where it either remains
Akagi, Javier T. +4 more
core +3 more sources
Моделирование и анализ информационных систем, 2015 We study a problem about the number of lattice plane tilings by the given area centrosymmetrical polyominoes. A polyomino is a connected plane geomatric figure formed by joiining a finite number of unit squares edge to edge.
A. V. Shutov, E. V. Kolomeykina
doaj +1 more source
Tiling a Rectangle with Polyominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 A polycube in dimension $d$ is a finite union of unit $d$-cubes whose vertices are on knots of the lattice $\mathbb{Z}^d$. We show that, for each family of polycubes $E$, there exists a finite set $F$ of bricks (parallelepiped rectangles) such that the ...
Olivier Bodini
doaj +1 more source
Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a Cyclic Lemma [PDF]
, 2015 We introduce two operators on stable configurations of the sandpile model that provide an algorithmic bijection between recurrent and parking configurations. This bijection preserves their equivalence classes with respect to the sandpile group. The study
Aval, Jean-Christophe +3 more
core +5 more sources
Vision‐Based Dirt Detection and Adaptive Tiling Scheme for Selective Area Coverage
Journal of Sensors, Volume 2018, Issue 1, 2018., 2018 This paper proposes a visual dirt detection algorithm and a novel adaptive tiling‐based selective dirt area coverage scheme for reconfigurable morphology robot. The visual dirt detection technique utilizes a three‐layer filtering framework which includes a periodic pattern detection filter, edge detection, and noise filtering to effectively detect and ...
Balakrishnan Ramalingam +5 more
wiley +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 ...
Aichholzer, Oswin +8 more
openaire +6 more sources
Generalisation over Details: The Unsuitability of Supervised Backpropagation Networks for Tetris
Advances in Artificial Neural Systems, Volume 2015, Issue 1, 2015., 2015 We demonstrate the unsuitability of Artificial Neural Networks (ANNs) to the game of Tetris and show that their great strength, namely, their ability of generalization, is the ultimate cause. This work describes a variety of attempts at applying the Supervised Learning approach to Tetris and demonstrates that these approaches (resoundedly) fail to ...
Ian J. Lewis +2 more
wiley +1 more source