An efficient algorithm for computing the maximum empty rectangle in three dimensions
Authors:
- 30 September 2000
- journal article
- Published by Elsevier in Information Sciences
- Vol. 128 (1-2) , 43-65
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Efficient algorithms for the largest rectangle problemInformation Sciences, 1992
- A new algorithm for the largest empty rectangle problemAlgorithmica, 1990
- Fast algorithms for direct enclosures and direct dominancesJournal of Algorithms, 1989
- An efficient algorithm for maxdominance, with applicationsAlgorithmica, 1989
- Fast algorithms for computing the largest empty rectangle1987
- Computing the Largest Empty RectangleSIAM Journal on Computing, 1986
- A note on finding a maximum empty rectangleDiscrete Applied Mathematics, 1986
- Direct dominance of pointsInternational Journal of Computer Mathematics, 1986
- On the maximum empty rectangle problemDiscrete Applied Mathematics, 1984
- On the Average Number of Maxima in a Set of Vectors and ApplicationsJournal of the ACM, 1978