Constant Time RMESH Algorithm for Linear Translation of Linear Quadtrees


The KIPS Transactions:PartA, Vol. 10, No. 3, pp. 207-214, Aug. 2003
10.3745/KIPSTA.2003.10.3.207,   PDF Download:

Abstract

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary 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 with quadtrees. The linear translation is one of important operations in image processing, which moves the image by a given distance. In this paper, we present an algorithm to perform the linear translation of binary images represented by quadtrees, using three-dimensional processors on RMESH (Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of RMESH.


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]
K. G. Hun and U. J. Un, "Constant Time RMESH Algorithm for Linear Translation of Linear Quadtrees," The KIPS Transactions:PartA, vol. 10, no. 3, pp. 207-214, 2003. DOI: 10.3745/KIPSTA.2003.10.3.207.

[ACM Style]
Kim Gyeong Hun and U Jin Un. 2003. Constant Time RMESH Algorithm for Linear Translation of Linear Quadtrees. The KIPS Transactions:PartA, 10, 3, (2003), 207-214. DOI: 10.3745/KIPSTA.2003.10.3.207.