Constant Time Algorithms for Region Expansion and Scaling of Linear Quadtrees on RMESH


The KIPS Transactions:PartA, Vol. 11, No. 3, pp. 173-180, Jun. 2004
10.3745/KIPSTA.2004.11.3.173,   PDF Download:

Abstract

Quadtree, which is a hierarchical data structure, is a very important data structure to represent images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related to quadtrees. The region expansion is an operation to expand images by a given distance and the scaling is an operation to scale images by a given scale factor. In this paper, we present algorithms to perform the region expansion and scaling of images represented by quadtrees, using three-dimensionalprocessors on RMESH(Reconfigurable MESH). These algorithms have constant time complexities by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure ofRMESH.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. W. Woo, "Constant Time Algorithms for Region Expansion and Scaling of Linear Quadtrees on RMESH," The KIPS Transactions:PartA, vol. 11, no. 3, pp. 173-180, 2004. DOI: 10.3745/KIPSTA.2004.11.3.173.

[ACM Style]
Jin Woon Woo. 2004. Constant Time Algorithms for Region Expansion and Scaling of Linear Quadtrees on RMESH. The KIPS Transactions:PartA, 11, 3, (2004), 173-180. DOI: 10.3745/KIPSTA.2004.11.3.173.