Optimization of Quadtree Representation and Compression

The quadtrees are a popular representation method for spatial data. In 2009, a heuristic algorithm, called CORN (Choosing an Optimal Root Node), for finding a root node of a region quadtree, has been proposed. It substantially reduces the number of leaf nodes when compared with the standard quadtree decomposition. In this paper, some approximation ideas are applied to improve the CORN algorithm. The empirical results indicate that the new proposed algorithm improves the quadtree representation and data compression.