query: How many rectangles can be observed in the grid?
positive_passages.docid: 62518
positive_passages.text: How many rectangles or triangles.
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: 28843
negative_passages.text: Algorithm for finding the fewest rectangles to cover a set of rectangles without overlapping
negative_passages.docid: 135298
negative_passages.text: Calculating extent of custom tiles?
negative_passages.docid: 6647
negative_passages.text: Do I have to code each case of this Grid full of plots separately?
negative_passages.docid: 156948
negative_passages.text: Equation of a rectangle
negative_passages.docid: 19420
negative_passages.text: Find the set of largest contiguous rectangles to cover multiple areas
negative_passages.docid: 129459
negative_passages.text: Possible to draw an Item in a Grid with only 3 sides of a Frame?
negative_passages.docid: 131136
negative_passages.text: How can I create an advanced grid interface?
negative_passages.docid: 75691
negative_passages.text: How to check if a point is inside a rectangle?
negative_passages.docid: 118098
negative_passages.text: Rectangles Covering
negative_passages.docid: 133392
negative_passages.text: How can I generate irregular grid containing minimum n points?
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: 52342
negative_passages.text: Partition rectangle into finite number of squares
negative_passages.docid: 35864
negative_passages.text: Playing with numbers form $1$ to $n^2$ in an $n\times n$ grid
negative_passages.docid: 69849
negative_passages.text: How to solve 5x5 grid with 16 diagonals?
negative_passages.docid: 44394
negative_passages.text: Coloring a $10×10$ grid