Primitive quadtree and type code quadtree approaches for the representation of binary regions
Zhongqiang Li, Duncan J. Telfer
Abstract
Zhongqiang Li, Duncan J. Telfer
Abstract
Two new schemes for representing binary regions with the hierarchical quadtree structure are presented in this paper. These are called the primitive quadtree and the type code quadtree. The primitive quadtree appears to be 65% more compact than the classical quadtree. The type code quadtree is even more compact than the primitive quadtree due to the introduction of type codes into the primitive quadtree. A 40% reduction in the number of primitive nodes of the primitive quadtree can be obtained, according to experimental results on some practical images. >
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Two new schemes for representing binary regions with the hierarchical quadtree structure are presented in this paper. These are called the primitive quadtree and the type code quadtree. The primitive quadtree appears to be 65% more compact than the classical quadtree. The type code quadtree is even more compact than the primitive quadtree due to the introduction of type codes into the primitive quadtree. A 40% reduction in the number of primitive nodes of the primitive quadtree can be obtained, according to experimental results on some practical images. >
Key concepts: Quadtree, Representation (politics), Computer science, Algorithm, Political science, Politics, Law