query: Tiling a rectangle with L-tromino
positive_passages.docid: 122151
positive_passages.text: Proof a $2^n$ by $2^n$ board can be filled using L shaped trominoes and 1 monomino
negative_passages.docid: 108
negative_passages.text: Hatch a rectangle in TikZ
negative_passages.docid: 44547
negative_passages.text: How can I subdivide this plane into even squares?
negative_passages.docid: 112698
negative_passages.text: Determine if two rectangles overlap each other?
negative_passages.docid: 18482
negative_passages.text: Can the squares with side $1/n$ be packed into a $1 \times \zeta(2)$ rectangle?
negative_passages.docid: 69393
negative_passages.text: Calculate rectangle vertices
negative_passages.docid: 119304
negative_passages.text: Latin Square and Graph Theory
negative_passages.docid: 74927
negative_passages.text: Set the same height of the rectangle with different splits in tikz
negative_passages.docid: 110697
negative_passages.text: How to unproject quadrilateral into rectangle?
negative_passages.docid: 10874
negative_passages.text: Map points on a square onto a Torus
negative_passages.docid: 42270
negative_passages.text: Combinatorics - Painting the Unit Squares of a 3x3 Square
negative_passages.docid: 7944
negative_passages.text: What algorithm can be used for packing rectangles of different sizes into the smallest rectangle possible in a fairly optimal way?
negative_passages.docid: 46469
negative_passages.text: $n$ Lines in the Plane
negative_passages.docid: 103190
negative_passages.text: Algorithm to get the maximum size of n squares that fit into a rectangle with a given width and height
negative_passages.docid: 152478
negative_passages.text: Is there a homeomorphism between the $n$-dimensional cube to the $n$-dimensional simplex that doesn't create hard corners?
negative_passages.docid: 94577
negative_passages.text: Filling a polygon with a pattern of insets
negative_passages.docid: 145304
negative_passages.text: Path finding in grid for objects that occupy more than one tile