An efficient algorithm for computing the maximum empty rectangle in three dimensions-Reference-Cited by-同舟云学术

An efficient algorithm for computing the maximum empty rectangle in three dimensions

Published:2000-09 Issue:1-2 Volume:128 Page:43-65
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Datta Amitava,Soundaralakshmi Subbiah

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference13 articles.

1. A. Aggarwal, S. Suri, Fast algorithms for computing the largest empty rectangle, in: Proceedings of the Third ACM Symposium on Computational Geometry, 1987, pp. 278–290

2. A note on finding the maximum empty rectangle;Atallah;Discrete Appl. Math.,1986

3. An efficient algorithm for maxdominance, with applications;Atallah;Algorithmica,1989

4. On the average number of maxima in a set of vectors and applications;Bentley;J. Assoc. Comput. Mach.,1978

5. Computing the largest empty rectangle;Chazelle;SIAM J. Comput.,1986

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

1. Computational Geometry Column 69;ACM SIGACT News;2019-09-24

2. On the Number of Maximum Empty Boxes Amidst n Points;Discrete & Computational Geometry;2017-02-23

3. Separating bichromatic point sets by two disjoint isothetic rectangles;Scientia Iranica;2016-07-01

4. Big Holes in Big Data: A Monte Carlo Algorithm for Detecting Large Hyper-Rectangles in High Dimensional Data;2016 IEEE 40th Annual Computer Software and Applications Conference (COMPSAC);2016-06

5. Computational Geometry Column 60;ACM SIGACT News;2014-12-09