We present a new algorithm for reporting all the enclosures in a set of pla
ne rectangles in O(n log n log log n + k log log n) time and O(n) space (k
denotes the output size). The result is already known but the proposed algo
rithm uses simple data structures. (C) 1999 Elsevier Science B.V. All right
s reserved.