Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
2L convex polyominoes: discrete tomographical aspects
View through CrossRef
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 shape of these polyominoes by combining 4 types of geometries. Some modifications are made in the reconstruction algorithm of Chrobak and Durr for HV -convex polyominoes in order to impose these geometries.
Title: 2L convex polyominoes: discrete tomographical aspects
Description:
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 shape of these polyominoes by combining 4 types of geometries.
Some modifications are made in the reconstruction algorithm of Chrobak and Durr for HV -convex polyominoes in order to impose these geometries.
Related Results
Ostrowski-Type Fractional Integral Inequalities: A Survey
Ostrowski-Type Fractional Integral Inequalities: A Survey
This paper presents an extensive review of some recent results on fractional Ostrowski-type inequalities associated with a variety of convexities and different kinds of fractional ...
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...
Two subclasses of 2-convex polyominoes: properties for reconstruction
Two subclasses of 2-convex polyominoes: properties for reconstruction
A polyomino P is called 2-convex if for every two cells there exists a monotone path included in P with at most 2 changes of direction. This paper studies the tomographical aspects...
RECONSTRUCTION OF TWO SUBCLASSES OF 2L-CONVEX POLYOMINOES
RECONSTRUCTION OF TWO SUBCLASSES OF 2L-CONVEX POLYOMINOES
A polyomino P is called 2L-convex if for every two cells there exists a monotone path included in P with at most 2 changes of direction. This paper studies the geometrical and the ...
2L-convex polyominoes: Geometrical aspects
2L-convex polyominoes: Geometrical aspects
A polymino P is called 2L-convex if for every two cells there exists a monotone path included in P with at most 2 changes of direction. This paper studies the geometrical aspects o...
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...
Tilings by Translation: Enumeration by a Rational Language Approach
Tilings by Translation: Enumeration by a Rational Language Approach
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes, i.e. those polyominoes that tile the plane by translation: a polyomino tiles ...
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 ...