Constant Time KVKSH Algorithm to Find Neighbor Blocks in Linear ~Quadtrees


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 1, pp. 66-74, Jan. 1999
10.3745/KIPSTE.1999.6.1.66,   PDF Download:

Abstract

A linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. It, therefore, has been widely studied to develop efficient algorithms to execute operations related with quadtrees. In this paper, we present algorithm to find neighbor blocks of binary images represented by linear quadtrees, using three-dimensional n x n x n processors on RMESH(Reconfigurable MESH). Our algorithm have O(1) time complexity.


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. Won and W. J. Woon, "Constant Time KVKSH Algorithm to Find Neighbor Blocks in Linear ~Quadtrees," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 1, pp. 66-74, 1999. DOI: 10.3745/KIPSTE.1999.6.1.66.

[ACM Style]
Kim Gi Won and Woo Jim Woon. 1999. Constant Time KVKSH Algorithm to Find Neighbor Blocks in Linear ~Quadtrees. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 1, (1999), 66-74. DOI: 10.3745/KIPSTE.1999.6.1.66.