Constant Time Algorithm for Computing Block Location of Linear Quadtree on RMESH


The KIPS Transactions:PartA, Vol. 14, No. 3, pp. 151-158, Jun. 2007
10.3745/KIPSTA.2007.14.3.151,   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 with quadtrees. The computation of block location is one of important geometry operations in image processing, which extracts a component completely including a given block. In this paper, we present a constant time algorithm to compute the block location of images represented by quadtrees, using three-dimensional n X n X n processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to deal with the locational codes of quardtree on the hierarchical structure of n X n X n 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]
S. M. Han and J. W. Woo, "Constant Time Algorithm for Computing Block Location of Linear Quadtree on RMESH," The KIPS Transactions:PartA, vol. 14, no. 3, pp. 151-158, 2007. DOI: 10.3745/KIPSTA.2007.14.3.151.

[ACM Style]
Seon Mi Han and Jin Woon Woo. 2007. Constant Time Algorithm for Computing Block Location of Linear Quadtree on RMESH. The KIPS Transactions:PartA, 14, 3, (2007), 151-158. DOI: 10.3745/KIPSTA.2007.14.3.151.