Abstract
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(n 3) and O(n 2) respectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Aggarwal and S. Suri, Fast algorithm for computing the largest empty rectangle, Proc. 3rd Annual ACM Symp. on Computational Geometry, pp. 278–290, 1987. 34
D. P. Dobkin, H. Edelsbrunner and M. H. Overmars, Searching for empty convex polygons, Proc. 4th ACM Symp. on Computational Geometry, pp. 224–228, 1988. 34
A. Naamad, D. T. Lee and W. L. Hsu, On the maximum empty rectangle problem, Discrete Applied Mathematics, vol. 8, pp. 267–277, 1984. 34
S. C. Nandy, B. B. Bhattacharya and S. Ray, Efficient algorithms for identifying all maximal empty rectangles in VLSI layout design, Proc. FSTTCS-10, Lecture Notes in Computer Science, vol. 437, Springer, pp. 255–269, 1990. 34
S. C. Nandy, A. Sinha and B. B. Bhattacharya, Location of largest empty rectangle among arbitrary obstacles, Proc. FSTTCS-14, Lecture Notes in Computer Science, vol. 880, Springer, pp. 159–170, 1994. 34
M. Orlowski, A new algorithm for largest empty rectangle problem, Algorithmica, vol. 5, pp. 65–73, 1990. 34, 38
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaudhuri, J., Nandy, S.C. (1999). Largest Empty Rectangle among a Point Set. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1999. Lecture Notes in Computer Science, vol 1738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46691-6_3
Download citation
DOI: https://doi.org/10.1007/3-540-46691-6_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66836-7
Online ISBN: 978-3-540-46691-8
eBook Packages: Springer Book Archive