query: Find the set of largest contiguous rectangles to cover multiple areas
positive_passages.docid: 28843
positive_passages.text: Algorithm for finding the fewest rectangles to cover a set of rectangles without overlapping
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: 154571
negative_passages.text: Algorithm to find elements best fitting in a particular amount
negative_passages.docid: 118551
negative_passages.text: Simplest way to calculate the intersect area of two rectangles
negative_passages.docid: 69565
negative_passages.text: Finding contiguous ranges in grouped data
negative_passages.docid: 5448
negative_passages.text: Finding the closure of some subsets of the ordered square
negative_passages.docid: 137072
negative_passages.text: Number Of Distinct Paths In A Rectangular Grid
negative_passages.docid: 28453
negative_passages.text: Finding all partitions of a set
negative_passages.docid: 69393
negative_passages.text: Calculate rectangle vertices
negative_passages.docid: 66474
negative_passages.text: Cutting a rectangle into squares
negative_passages.docid: 80458
negative_passages.text: How to efficiently find the largest perfect square dividing a given large integer?
negative_passages.docid: 109290
negative_passages.text: How to find the smallest enclosing circle over a set of circles?
negative_passages.docid: 100237
negative_passages.text: Rectangle and Circle collision detection
negative_passages.docid: 42270
negative_passages.text: Combinatorics - Painting the Unit Squares of a 3x3 Square
negative_passages.docid: 145427
negative_passages.text: Determine if a set of tiles on a grid forms an enclosed shape
negative_passages.docid: 134823
negative_passages.text: How to find the area of any irregular shape?
negative_passages.docid: 44394
negative_passages.text: Coloring a $10×10$ grid