Abstract

this paper deals with a two-dimensional (2-d) space-filling approach in which each node is a rectangle whose area is proportional to some attribute such as node size. Research on relationships between 2-d images and their representation in tree structures has focussed on node and link representations of 2-d images. This work includes quad-trees (Samet, 1989) and their variants which are important in image processing. The goal of quad trees is to provide a tree representation for storage compression and efficient operations on bit-mapped images. XY-trees (Nagy & Seth, 1984) are a traditional tree representation of two-dimensional layouts found in newspaper, magazine, or book pages. Related concepts include k-d trees (Bentley and Freidman, 1979), which are often explained with the help of a

Citations

299	The Art of Computer Programming, volume 1 (Fundamental Algorithms - Knuth - 1973
167	The hb-tree: a multiattribute indexing method with good guaranteed performance - Lomet, Salzberg - 1990
130	Data Structures for Range Searching - Bentley, Friedman - 1979
86	Hierarchical representation of optically scanned documents - Nagy, Seth - 1984