Computing the largest empty rectangle-Reference-Cited by-同舟云学术

Computing the largest empty rectangle

Published:1984 Issue: Volume: Page:43-54
ISSN:0302-9743
Container-title:STACS 84
language:
Short-container-title:

Author:

Chazelle B.,Drysdale R. L.,Lee D. T.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-12920-0_4

Reference15 articles.

1. Bentley, J. L., "Divide-and-conquer algorithms for closest point problems in multidimensional space," Ph. D. thesis, Dept. Comput. Sci., Univ. of North Carolina, Chapel Hill, NC., 1976.

2. Bentley J. L. and D. Wood, "An optimal worst case algorithm for reporting intersections of rectangles," IEEE Trans. Comput., (July 1980), 571–577.

3. Boyce, J. E., D. P. Dobkin, R. L. Drysdale III, and L. J. Guibas, "Finding extremal polygons," Proc. ACM Symp. Theory of Comput., (May 1982), 282–289.

4. Chazelle, B. M., R. L. Drysdale III, and D. T. Lee, "Computing the largest empty rectangle," Dept. Comput. Sci. Brown Univ. Tech. Rep. CS 83-20, Sept. 1983.

5. Dobkin, D. P., R. L. Drysdale III, and L. J. Guibas, "Finding smallest polygons," in Advances of Computing Research, Vol. 1, (F. P. Preparata, ed.), JAI Press Inc. (1983), 181–224.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Finding Largest Rectangle Inside a Digital Object;Computational Topology in Image Context;2016

2. A polynomial solution for the potato-peeling problem;Discrete & Computational Geometry;1986-06

3. A note on finding a maximum empty rectangle;Discrete Applied Mathematics;1986-01

4. Finding the largest empty rectangle on a grated surface;STACS 87