Results 141 to 150 of about 2,994 (170)
Partitioning polyominoes into polyominoes of at most 8 vertices [PDF]
, 2015 Ervin Győri, Tamás Róbert Mezei
openalex
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Indecomposability: polyominoes and polyomino tilings
The Mathematical Gazette, 2008When we were preparing our earlier article [1], we thought to look back to see what else had appeared in the Gazette on the subject of polyominoes .
Simone Rinaldi, D. G. Rogers
openaire +1 more source
Smooth Column Convex Polyominoes
Discrete & Computational Geometry, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Toufik Mansour, Armend Sh. Shabani
openaire +2 more sources
Proceedings of the twenty-seventh annual symposium on Computational geometry, 2011
We explore the art gallery problem for the special case that the domain (gallery) P is an m-polyomino, a polyform whose cells are m unit squares. We study the combinatorics of guarding polyominoes in terms of the parameter m, in contrast with the traditional parameter n, the number of vertices of P; in particular, we show that floor((m+1)/3) point ...
Therese Biedl +4 more
openaire +1 more source
We explore the art gallery problem for the special case that the domain (gallery) P is an m-polyomino, a polyform whose cells are m unit squares. We study the combinatorics of guarding polyominoes in terms of the parameter m, in contrast with the traditional parameter n, the number of vertices of P; in particular, we show that floor((m+1)/3) point ...
Therese Biedl +4 more
openaire +1 more source
2021 Data Compression Conference (DCC), 2021
We provide a compact representation of polyominoes with n cells that supports navigation and visibility queries in constant time. Our oracle takes 3n +o(n) bits. Previous enumeration efforts indicate that at least 2.00091 n -o(n) bits (likely 2.021 n -o(n) bits) are required to distinguish polyominoes, hence confirming that our oracle is compact.
openaire +1 more source
We provide a compact representation of polyominoes with n cells that supports navigation and visibility queries in constant time. Our oracle takes 3n +o(n) bits. Previous enumeration efforts indicate that at least 2.00091 n -o(n) bits (likely 2.021 n -o(n) bits) are required to distinguish polyominoes, hence confirming that our oracle is compact.
openaire +1 more source
Code for polyomino and computer search of isospectral polyominoes
Journal of Combinatorial Optimization, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liang, Xiaodong +2 more
openaire +1 more source
Polyomino subarraying through genetic algorithms
Proceedings of the 2012 IEEE International Symposium on Antennas and Propagation, 2012The synthesis of subarrayed phased antenna arrays for limited-field-of-view (LFOV) and wideband applications is addressed in this work. The tiling of the antenna aperture is obtained using polyomino subarrays of irregular shape. The position and orientation of each subarray are properly optimized by means of a strategy based on a genetic algorithm in ...
Rocca, Paolo, R. Mailloux, R. Chirikov
openaire +1 more source