Variant code transformations for linear quadtrees

In this paper, general guidelines and specific algorithms for code transformations between breadth-first (BF) and depth-first (DF) linear quadtrees are proposed. Each algorithm has time and space complexities in O

• Type: Journal
• Year: 2002
• Where: PRL
• Authors: Pei-Min Chen
• Keywords: Code Transformations, DF Linear Quadtree, Linear Quadtree, PRL 2002