Domino tiling

Known as: Domino covering, Dimer covering, Dimer tiling 
In geometry, a domino tiling of a region in the Euclidean plane is a tessellation of the region by dominos, shapes formed by the union of two unit… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1945-2018
010020030019452017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
In this paper, we study the problem of how to tile a layout with dominoes. For non-coloured dominoes, this can be determined… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We investigate certain measures induced by families of non-intersecting paths in domino tilings of the Aztec diamond, rhombus… (More)
Is this relevant?
2001
2001
We are interested in the reconstruction of a domino tiling of a rectangle from its two orthogonal projections. We give polynomial… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
In this paper, we continue the study of domino-tilings of Aztec diamonds. In particular, we look at certain ways of placing… (More)
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
1.1. Description of results. A domino is a 1×2 (or 2×1) rectangle, and a tiling of a region by dominos is a way of covering that… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
In [2], Giammarresi and Restivo define the notion of local picture languages by giving a set of authorized 2 x 2 tiles over C U… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We prove an asymptotic formula for the probability that, if one chooses a domino tiling of a large Aztec diamond according to the… (More)
  • figure 4
  • figure 5
Is this relevant?
1996
1996
We prove that Thurston’s linear-time tiling algorithm can be extended to all planar graphs that have a regular bipartite dual… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Let G be a finite graph or an infinite graph on which ZZ acts with finite fundamental domain. If G is finite, let T be a random… (More)
Is this relevant?
1986
1986
Games in which players build domino tilings are considered. The computational complexity of problems of existence of winning… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?