Largest empty rectangle among a point set

Journal of Algorithms

Volumn 46, Issue 1, 2003, Pages 54-78

  Chaudhuri, Jeet ^a   Nandy, Subhas C ^b   Das, Sandip ^b  

^a Alumnus Software Limited   (India)

^b INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; PROBLEM SOLVING; TWO DIMENSIONAL;

MAXIMAL EMPTY RECTANGLE; POINT SET;

SET THEORY;

EID: 0037219506     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(02)00285-7     Document Type: Article

References (10)

1. M.J. Atallah, S.R. Kosaraju, An efficient algorithm for maxdominance with applications, Algorithmica 4 (1989) 221-236.
2. A. Aggarwal, S. Suri, Fast algorithm for computing the largest empty rectangle, in: Proc. 3rd Annual ACM Symp. on Computational Geometry, 1987, pp. 278-290.
3. B. Chazelle, R.L. Drysdale, D.T. Lee, Computing the largest empty rectangle, SIAM J. Comput. 15 (1986) 300-315.
4. D.P. Dobkin, H. Edelsbrunner, M.H. Overmars, Searching for empty convex polygons, in: Proc. 4th Annual ACM Symp. on Computational Geometry, 1988, pp. 224-228.
5. K. Daniels, V. Milenkovic, D. Roth, Finding the largest area axis-parallel rectangle in a polygon, in: Computational Geometry: Theory and Applications, Vol. 7, 1997, pp. 125-148.
6. D.E. Knuth, Data Structure, in: The Art of Computer Programming, Vol. 1, Addison-Wesley, 1973.
7. A. Naamad, D.T. Lee, W.L. Hsu, On the maximum empty rectangle problem, Discrete Appl. Math. 8 (1984) 267-277.
8. S.C. Nandy, B.B. Bhattacharya, S. Ray, Efficient algorithms for identifying all maximal empty rectangles in VLSI layout design, in: Proc. FSTTCS-10, in: Lecture Notes in Comput. Sci., Vol. 437, Springer, 1990, pp. 255-269.
9. S.C. Nandy, A. Sinha, B.B. Bhattacharya, Location of largest empty rectangle among arbitrary obstacles, in: Proc. FSTTCS-14, in: Lecture Notes in Comput. Sci., Vol. 880, Springer, 1994, pp. 159-170.
10. M. Orlowski, A new algorithm for largest empty rectangle problem, Algorithmica 5 (1990) 65-73.