Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Counting Polyominoes, Revisited
View through CrossRef
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 bounding boxes on the square lattice rotated by 45o
instead of on the regular unrotated lattice.
This allows us to extend significantly the count of polyominoes from 56
to 70 terms.
Title: Counting Polyominoes, Revisited
Description:
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 bounding boxes on the square lattice rotated by 45o
instead of on the regular unrotated lattice.
This allows us to extend significantly the count of polyominoes from 56
to 70 terms.
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 ...
Increasing familiarity with the heartbeat counting task does not affect performance
Increasing familiarity with the heartbeat counting task does not affect performance
Background: Interoception is typically defined as the processing and perception of internal signals. A common evaluation of interoceptive abilities is via the perception of heartbe...
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...
Counting dense object of multiple types based on feature enhancement
Counting dense object of multiple types based on feature enhancement
IntroductionAccurately counting the number of dense objects in an image, such as pedestrians or vehicles, is a challenging and practical task. The existing density map regression m...
On counting Z-convex polyominoes
On counting Z-convex polyominoes
Abstract
We show a decomposition that allows to compute the number of convex polyominoes of area
n
an...
A Dynamical System Approach to Polyominoes Generation
A Dynamical System Approach to Polyominoes Generation
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 gene...