Fast algorithms for computing the largest empty rectangle

Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987

Volumn , Issue , 1987, Pages 278-289

  Aggarwal, Alok ^a   Suri, Subhash ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

FAST ALGORITHMS; FOLLOWING PROBLEM; LARGEST AREA RECTANGLES; LOWER BOUNDS; MEMORY SPACE; MULTIPLICATIVE CONSTANTS;

GEOMETRY;

EID: 85012251481     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/41958.41988     Document Type: Conference Paper

References (7)

1. A. Aggarwal, M. M. Klawe, S. Moran, P. W. Shor, and R. Wilber, "Geometric Applications of a Matrix Searching Algorithm, " Proc. of the Second Annual Symposium on Computational Geometry, Yorktown Heights, New York, June 1986.
2. M. J. Atallah and G. N. Fredrickson, "A Note on Finding the Maximum Empty Rectangle, " Discrete Applied Math., Vol 13, pp. 87-91, 1986.
3. M. J. Atallah and S. R. Kosaraju, Manuscript, in preparation
4. B. M. Chazelle, R. L. Drysdale m, and D. T. Lee, "Computing the Largest Empty Rectangle, " SIAM J. of Computing. Vol. 15, No. 1, Feb. 1986, pp. 300-315. Also available as Technical Report No. CS 83-20, Department of Computer Science, Brown University, Nov. 1983.
5. M. Mckenna, J. O'Rourke, and S. Suri, "Finding the Largest Rectangle in an Orthogonal Polygon." Proc. of the 23rd Annual Allerton Conference on Communication, Control and Computing, Urbana-Champaingn, Illinois. October 1985.
6. A. Namaad, W. L Hsu, and D. T. Lee, "On Maximum Empty Rectangle Problem, " Discrete Applied Math., VoL 8, pp. 267-277, 1984.
7. M. Tompa, Personal Communication, 1986.