A new algorithm for rectangle enclosure reporting
We present a new algorithm for reporting all the enclosures in a set of plane 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 algorithm uses simple data structures. (C) 1999 Elsevier Science B.V. All rights reserved.
data structures computational geometry dominance reporting