Fast algorithms for computing the largest empty rectangle
SCG '87 Proceedings of the third annual symposium on Computational geometry
Searching for empty convex polygons
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design
Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
Location of the Largest Empty Rectangle among Arbitrary Obstacles
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
This paper generalizes the classical MER problem in 2D. Given a set P of n points, here a maximal empty rectangle (MER) is defined as a rectangle of arbitrary orientation such that each of its four sides coincides with at least one member of P and the interior of the rectangle is empty. We propose a simple algorithm based on standard data structure to locate largest area MER on the floor. The time and space complexities of our algorithm are O(n3) and O(n2) respectively.