EFFICIENT DETERMINATION OF HOMOGENEOUS RECTANGLES IN A BINARY MATRIX

摘要

Determining maximal empty rectangles in a binary matrix includes building values in a staircase data structure for each successive entry in the matrix. The values in the staircase data structure are removed where the values correspond to maximal rectangles having the successive entry in the bottom right corner of the rectangle. The values in the staircase data structure for each successive entry being determinable from values in the staircase data structure for a preceding entry in the matrix. The maximal empty rectangles providing a basis for generating efficient relational join operations on defined relational tables.