The Maximum Disjoint Set of Boundary Rectangles
AmirMahdi Ahmadinejad, Hamid Zarrabi-Zadeh · 2014
We consider the problem of finding a maximum disjoint set of boundary rectangles, where all rectangles are at-tached to the boundary of a bounding box. We present an algorithm for solving the problem in O(n4) time, improving upon the best previous O(n6)-time solution available for the problem. 1