Distrbuted Processing and Constant Time KVIESH Algorithm for Computing Area and Perimeter of Binary Image Represented by Linear Quadtrees


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 7, pp. 1746-1758, Jul. 1998
10.3745/KIPSTE.1998.5.7.1746,   PDF Download:

Abstract

Quadtree, which is hierarchical data structure, is a very important data structure to represent binary images. 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 algorithms to compute the area and perimeter of binary images represented by quadtrees, using three-dimensional n?n?n processors on RMESH(Reconfigurable MESH). Our algorithms 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, "Distrbuted Processing and Constant Time KVIESH Algorithm for Computing Area and Perimeter of Binary Image Represented by Linear Quadtrees," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 7, pp. 1746-1758, 1998. DOI: 10.3745/KIPSTE.1998.5.7.1746.

[ACM Style]
Kim Gi Won and Woo Jim Woon. 1998. Distrbuted Processing and Constant Time KVIESH Algorithm for Computing Area and Perimeter of Binary Image Represented by Linear Quadtrees. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 7, (1998), 1746-1758. DOI: 10.3745/KIPSTE.1998.5.7.1746.