Tiling with Squares and Packing Dominos in Polynomial Time
From MaRDI portal
Publication:6051995
DOI10.1145/3597932arXiv2011.10983OpenAlexW3106614825MaRDI QIDQ6051995
Thomas D. Ahle, Mikkel Abrahamsen, Peter M. R. Rasmussen, Anders Aamand
Publication date: 23 October 2023
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.10983
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast domino tileability
- Optimal packing and covering in the plane are NP-complete
- Triangulating a simple polygon in linear time
- On translating one polyomino to tile the plane
- Pocket machining based on contour-parallel tool paths generated by means of proximity maps
- Tiling figures of the plane with two bars
- Tiling with polyominoes and combinatorial group theory
- Tiling simply connected regions with rectangles
- Complexity of tiling a polygon with trominoes or bars
- Tiling a polygon with two kinds of rectangles
- Conway's Tiling Groups
- TWO THEOREMS IN GRAPH THEORY
- Generalized planar matching
- Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time
- Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
- Approximation schemes for covering and packing problems in image processing and VLSI
- THE L∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS
- Flow in Planar Graphs with Multiple Sources and Sinks
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
- The undecidability of the domino problem
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Checker Boards and Polyominoes
- Approximation of geometric dispersion problems
