A new algorithm for the largest empty rectangle problem
- 333 Downloads
A rectangleA and a setS ofn points inA are given. We present a new simple algorithm for the so-called largest empty rectangle problem, i.e., the problem of finding a maximum area rectangle contained inA and not containing any point ofS in its interior. The computational complexity of the presented algorithm isO(n logn + s), where s is the number of possible restricted rectangles considered. Moreover, the expected performance isO(n · logn).
Key wordsComputational geometry Algorithms Computational complexity Largest empty rectangle problem
Unable to display preview. Download preview PDF.