query: Find fewest rectangles that cover 1's in a grid
positive_passages.docid: 19420
positive_passages.text: Find the set of largest contiguous rectangles to cover multiple areas
negative_passages.docid: 75691
negative_passages.text: How to check if a point is inside a rectangle?
negative_passages.docid: 101642
negative_passages.text: Counting in a rectangular grid with obstacles
negative_passages.docid: 5144
negative_passages.text: Algorithm to detect intersection of two rectangles?
negative_passages.docid: 82327
negative_passages.text: Tiling a $3 \times 2n$ rectangle with dominoes
negative_passages.docid: 15976
negative_passages.text: Smallest possible triangle to contain a square
negative_passages.docid: 42945
negative_passages.text: Find the minimal number of guard points of polygon
negative_passages.docid: 158494
negative_passages.text: Properties of special rectangle (measure)
negative_passages.docid: 137072
negative_passages.text: Number Of Distinct Paths In A Rectangular Grid
negative_passages.docid: 101181
negative_passages.text: Tiling problem: 100 by 100 grid and 1 by 8 pieces
negative_passages.docid: 43583
negative_passages.text: Algorithm to find k smallest numbers in array of n items
negative_passages.docid: 8796
negative_passages.text: Grid - sizing and spacing problems with spanning cells
negative_passages.docid: 44070
negative_passages.text: Recurrence  for number of regions formed by diagonals of a convex polygon.
negative_passages.docid: 44394
negative_passages.text: Coloring a $10×10$ grid
negative_passages.docid: 83250
negative_passages.text: How can I find the number of the shortest paths between two points on a 2D lattice grid?
negative_passages.docid: 122558
negative_passages.text: Testing for players within a specified rectangular area
negative_passages.docid: 154571
negative_passages.text: Algorithm to find elements best fitting in a particular amount