The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 14-25
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On Approximating the Depth and Related ProblemsSIAM Journal on Computing, 2008
- Mining for empty spaces in large data setsTheoretical Computer Science, 2003
- The Maximum Box Problem and its Application to Data AnalysisComputational Optimization and Applications, 2002
- An efficient algorithm for computing the maximum empty rectangle in three dimensionsInformation Sciences, 2000
- Maximal empty cuboids among points and blocksComputers & Mathematics with Applications, 1998
- Computing the Maximum Bichromatic Discrepancy, with Applications to Computer Graphics and Machine LearningJournal of Computer and System Sciences, 1996
- A new algorithm for the largest empty rectangle problemAlgorithmica, 1990
- Fast algorithms for computing the largest empty rectangle1987
- Computing the Largest Empty RectangleSIAM Journal on Computing, 1986
- On the maximum empty rectangle problemDiscrete Applied Mathematics, 1984