Computing the largest empty rectangle
SIAM Journal on Computing
Fast algorithms for computing the largest empty rectangle
SCG '87 Proceedings of the third annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
In this paper, we report on the theory and implementation of an O(n3) algorithm for computing the largest empty rectangle of arbitrary orientation for a given set of n points in the plane.