Variant code transformations for linear quadtrees

Authors:
Pei-Min Chen
Affiliations:
Department of Computer and Information Science, Soochow University, 56, Kuei-Yang St., Section 1, Taipei, Taiwan, ROC
Venue:
Pattern Recognition Letters
Year:
2002

Citing 5
Cited 1

Applications of spatial data structures: Computer graphics, image processing, and GIS

Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures

The design and analysis of spatial data structures
An effective way to represent quadtrees

Communications of the ACM
Relational-Linear Quadtree Approach for Two-Dimensional Spatial Representation and Manipulation

IEEE Transactions on Knowledge and Data Engineering
Set operations on constant bit-length linear quadtrees

Pattern Recognition

A hybrid gray image representation using spatial- and DCT-based approach with application to moment computation

Journal of Visual Communication and Image Representation

Quantified Score

Hi-index	0.10

Visualization

Abstract

In this paper, general guidelines and specific agorithms for code transformations between breadth-first (BF) and depth-first (DF) linear quadtrees are proposed. Each algorithm has time and space complexities in O(l), where l is the length of the code of a BF or DF linear quadtree.