Quadtree Generation and Manipulation Based on Boundary Discretization in Hypercube Architecture

Abstract—A quadtree is a hierarchical data structure used in many computer graphics, image processing, and computational geometry applications. In these applications, we need to obtain information about the quadtree nodes near a given quadtree node. Therefore, in a parallel environment, nodes that are geometrically close should be stored in processors that are close in the interconnection network. We present, in a hypercube architecture, the generation process of the tree based on boundary discretization and we propose a procedure to balance the load using a top-down approach. Keywords-Quadtrees; parallel computing. I