Pages that link to "Item:Q1401372"
From MaRDI portal
The following pages link to An \(O(n \log n)\)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded. (Q1401372):
Displaying 9 items.
- Fast domino tileability (Q312152) (← links)
- Domino portrait generation: a fast and scalable approach (Q545542) (← links)
- Domino tilings and related models: Space of configurations of domains with holes (Q596048) (← links)
- Tiling pictures of the plane with dominoes (Q1356753) (← links)
- Tiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposion (Q1366534) (← links)
- An optimal algorithm to generate tilings (Q2466003) (← links)
- Optimal Partial Tiling of Manhattan Polyominoes (Q3648774) (← links)
- (Q4850437) (← links)
- A heuristic approach to domino grid problem (Q6089319) (← links)