The quadtree data structure is extensively used in representing 2dimensional data in many applications like image processing, cartographic data processing. VLSI embedding, graphics, computer animation, computer-aided architecture, etc. The data structure employs the divideand-conquer technique to recursively decompose the planar region. This paper addresses the problem of planar tessellation wh...

We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner triangulation (MWST) of the polygon. We show that this approximate MWST supports ray shooting queries in the query-sensitive sense as deened by Mitchell, Mount and Suri. A proper truncation of our quadtree-based decomp...

In this paper a novel technique for rotation independent template matching via Quadtree Zernike decomposition is presented. Both the template and the target image are decomposed by using a complex polynomial basis. The template is analyzed in block-based manner by using a quad tree decomposition. This allows the system to better identify the object features. Searching for a complex pattern into...

A novel spatial data structure called the orientation adaptive quadtree (OAQ) is presented. The data structure takes advantage oflarge second-order moments of inertia of planar objects by aligning the quad tree axes with the object's principal axis of inertia. This provides a reduction in the number of leaf nodes necessary to store the quadtree compared to quadtrees aligned with the object coor...

Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these trees, we offer a universal law of large numbers and a limit law for the depth of the last inserted point, as well as a law of large numbers for the height.

ii Acknowledgements iii

An algorithm is resented for con8tructing a quadtree from the array repre+@&oa of a binary u. %h e algorithm examines each pixel in the w once aasd only once. In addition, aa the tree ie con&u&d, only m&iial &ed nodea are ever cd. Thua the algorithm never requirea temporary nodes. The execution time of the B@-rithm is equal to the number of pixel43 in the we. The amount of sp&oe, in 84$& tion t...

Quadtree representation is a method representing a frequency distribution of all oligo nucleotides in long DNA sequences. The method is theoretically equivalent to chaos game representation [2, 3], which represents orbits of the chaos game system (or iterated function system [1]) driven by the DNA sequences. Since the relation between a point in the orbit and a subsequence in the driving DNA se...