Results 21 to 30 of about 138,162 (330)
Hexagonal Inflation Tilings and Planar Monotiles [PDF]
, 2012 Baake M, Gähler F, Grimm U. Hexagonal Inflation Tilings and Planar Monotiles. Symmetry. 2012;4(4):581-602.Aperiodic tilings with a small number of prototiles are of particular interest, both theoretically and for applications in crystallography.
Uwe Grimm +6 more
core +1 more source
CoRR, 2015 We look at sets of tiles that can tile any region of size greater than 1 on the square grid. This is not the typical tiling question, but relates closely to it and therefore can help solve other tiling problems -- we give an example of this. We also present a result to a more classic tiling question with dominoes and L-shape tiles.
Anne Kenyon, Martin Tassy
openaire +2 more sources
, 2006 We exhibit a subset of a finite Abelian group, which tiles the group by translation, and such that its tiling complements do not have a common spectrum (orthogonal basis for their L-2 space consisting of group characters).
Kolountzakis, M. N., Matolcsi, Máté
core +1 more source
, 2020 We propose a new concept“ambiguous tiling”，which is the combination of tiling art and ambiguous cylinders. Tiling art is an artistic pattern consisting of copies of one or a few kinds of tiles which cover the whole 2D plane without gaps or overlaps ...
杉原,厚吉, Sugihara,Kokichi
core +1 more source
Hard Tiling Problems with Simple Tiles [PDF]
Discrete & Computational Geometry, 2001 It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right tromino alone. In the process, we show that Monotone 1-in-3 Satisfiability is NP-complete for planar cubic graphs.
Cristopher Moore, J. M. Robson
openaire +3 more sources
Complexity of Tiling a Polygon with Trominoes or Bars [PDF]
, 2017 We study the computational hardness of the tiling puzzle with polyominoes, where a polyomino is a rectilinear polygon (i.e., a polygon made by connecting unit squares.) In the tiling problem, we are given a rectilinear polygon P and a set S of ...
Horiyama, Takashi +9 more
core +1 more source
Cell Reports, 2016 Simple cell-cell interactions can give rise to complex cellular patterns. For example, neurons of the same type can interact to create a complex patchwork of non-overlapping dendrite arbors, a pattern known as dendrite tiling.
Zhiqi Candice Yip, Maxwell G. Heiman
doaj +1 more source
Adaptive sparse tiling for sparse matrix multiplication
ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 2019 Tiling is a key technique for data locality optimization and is widely used in high-performance implementations of dense matrix-matrix multiplication for multicore/manycore CPUs and GPUs. However, the irregular and matrix-dependent data access pattern of
Changwan Hong +4 more
semanticscholar +1 more source
The Mathematical Intelligencer, 2010 21 pages, 50 figures. Based on a Clay Public Lecture by the second author at the IAS/Park City Mathematics Institute in July, 2004.
Ardila, Federico, Stanley, Richard P.
openaire +4 more sources
Applied Sciences, 2018 In this study, we aim to optimize and improve the efficiency of a Tetris-inspired reconfigurable cleaning robot. Multi-criteria decision making (MCDM) is utilized as a powerful tool to target this aim by introducing the best solution among others in ...
Maryam Kouzehgar +4 more
doaj +1 more source