Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
A Dynamical System Approach to Polyominoes Generation
View through CrossRef
We describe a method which exploits discrete dynamical systems to generate suitable classes of polyominoes. We apply the method to design an algorithm that uses O( n) space to generate in constant amortized time all polyominoes corresponding to hole-free partially directed animals consisting of n sites on the square grid. By implementing the algorithm in C++ we have obtained a new sequence that does not appear in the On-Line Encyclopedia of Integer Sequences.
Title: A Dynamical System Approach to Polyominoes Generation
Description:
We describe a method which exploits discrete dynamical systems to generate suitable classes of polyominoes.
We apply the method to design an algorithm that uses O( n) space to generate in constant amortized time all polyominoes corresponding to hole-free partially directed animals consisting of n sites on the square grid.
By implementing the algorithm in C++ we have obtained a new sequence that does not appear in the On-Line Encyclopedia of Integer Sequences.
Related Results
On the number of isohedral polyominoes
On the number of isohedral polyominoes
A polyomino is a connected figure on a plane composed from a finite number of unit squares adjacent to each other on the sides. A tiling of a plane into polyominoes is called isohe...
Enumeration of minimal 3D polyominoes inscribed in a rectangular prism
Enumeration of minimal 3D polyominoes inscribed in a rectangular prism
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 ...
2L convex polyominoes: discrete tomographical aspects
2L convex polyominoes: discrete tomographical aspects
This paper uses the theoretical material developed in a previous article by the authors in order to reconstruct a subclass of 2L-convex polyominoes. The main idea is to control the...
Asymptotics of Z-convex polyominoes
Asymptotics of Z-convex polyominoes
The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction...
Early collisional evolution of TNOs
Early collisional evolution of TNOs
<p><strong>1. &#160; &#160;Introduction</strong><br />The currently accepted scenario states that the primor...
Computation, Dynamics, and Cognition
Computation, Dynamics, and Cognition
Currently there is growing interest in the application of dynamical methods to the study of cognition. Computation, Dynamics, and Cognition investigates this convergence from a the...
Dynamical properties of spatial discretizations of a generic homeomorphism
Dynamical properties of spatial discretizations of a generic homeomorphism
This paper concerns the link between the dynamical behaviour of a dynamical system and the dynamical behaviour of its numerical simulations. Here, we model numerical truncation as ...
Counting Polyominoes, Revisited
Counting Polyominoes, Revisited
Abstract
A polyomino is an edge-connected set of squares on the square lattice.
In this paper, we improve Jensen's algorithm for counting polyominoes
by considering boundin...