Hierarchical representations of collections of small rectangles

Hanan Samet
1988 ACM Computing Surveys  
A tutorial survey is presented of hierarchical data structures for representing collections of small rectangles. Rectangles are often used as an approximation of shapes for which they serve as the minimum rectilinear enclosing object. They arise in applications in cartography as well as very large-scale integration (VLSI) design rule checking. The different data structures are discussed in terms of how they support the execution of queries involving proximity relations. The focus is on
more » ... ion and subset queries. Several types of representations are described. Some are designed for use with the planesweep paradigm, which works well for static collections of rectangles. Others are oriented toward dynamic collections. In this case, one representation reduces each rectangle to a point in a higher multidimensional space and treats the problem as one involving point data. The other representation is area based-that is, it depends on the physical extent of each rectangle.
doi:10.1145/50020.50021 fatcat:l66m7opx2zgsbcjbt3wylw7atq