Efficient algorithms for the largest rectangle problem
References (11)
- et al.
A note on finding the maximum empty rectangle
Discrete Appl. Math.
(1986) - et al.
On rectangular visibility
J. Algorithms
(1988) - et al.
Fast algorithms for computing the largest empty rectangle
- et al.
Geometric applications of a matrix-searching algorithm
Algorithmica
(1987) - et al.
An efficient algorithm for maxdominance, with applications
Algorithmica
(1989)
There are more references available in the full text version of this article.
Cited by (9)
An efficient algorithm for computing the maximum empty rectangle in three dimensions
2000, Information SciencesOptimal algorithm for rectangle placement
1999, Operations Research LettersMaximal empty boxes amidst random points
2013, Combinatorics Probability and ComputingOn the largest empty axis-parallel box amidst n points
2013, AlgorithmicaMaximal empty boxes amidst random points
2012, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Maximal strips data structure to represent free space on partially reconfigurable FPGAs
2009, International Journal of Parallel, Emergent and Distributed Systems
Copyright © 1992 Published by Elsevier Inc.