Distributed Processing and Constant Time Algorithm for Building the Linear Quadtree on RMESH


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 9, pp. 2247-2258, Sep. 1997
10.3745/KIPSTE.1997.4.9.2247,   PDF Download:

Abstract

Quadtree, which is hierarchical data structure, is a very important data structure to represent binary images. Since a linear quadtree representation as is a way to store a quadtree is efficient to save compared with other reqresentations. It is, however, complicated and takes a large amount of time to build the linear quadtree. In this paper, we present O(1) time a linear quadtree building algorithm for a n×n binary image using tree-dimensional n×n×n processors on RMESH structure. Our algorithm, by use of O(1) time collapsing algorithm and reported O(1) time sorting algorithm, is simpler and easier to understand than resently presented algorithm on PARBUS structure.


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. H. Taek and W. J. Woon, "Distributed Processing and Constant Time Algorithm for Building the Linear Quadtree on RMESH," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 9, pp. 2247-2258, 1997. DOI: 10.3745/KIPSTE.1997.4.9.2247.

[ACM Style]
Kong Heon Taek and Woo Jin Woon. 1997. Distributed Processing and Constant Time Algorithm for Building the Linear Quadtree on RMESH. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 9, (1997), 2247-2258. DOI: 10.3745/KIPSTE.1997.4.9.2247.