论文信息 - Parallel processing of regions represented by linear quadtrees

Parallel processing of regions represented by linear quadtrees

We show how computation of geometric properties of a region represented by a linear quadtree can be speeded up by about a factor of p by using a p -processor CREW PRAM model of parallel computation. Similar speedups are obtained for computing the union and intersection of two regions, and the complement of a region, using linear quadtree representations.

Azriel Rosenfeld | Angela Y. Wu | S. K. Bhaskar | A. Rosenfeld | A. Wu

[1] Wentai Liu,et al. Parallel Processing for Quadtree Problems , 1986, ICPP.

[2] D J Evans,et al. Parallel processing , 1986 .

[3] Allen Klinger,et al. PATTERNS AND SEARCH STATISTICS , 1971 .

[4] Clyde P. Kruskal,et al. Searching, Merging, and Sorting in Parallel Computation , 1983, IEEE Transactions on Computers.

[5] S. Sitharama Iyengar,et al. Parallel Processing of Quadtrees on a Horizontally Reconfigurable Architecture Computing System , 1986, ICPP.

[6] Irene Gargantini,et al. An effective way to represent quadtrees , 1982, CACM.

[7] David M. Mark,et al. Two-dimensional run-encoding for quadtree representation , 1985, Comput. Vis. Graph. Image Process..

[8] Allan Borodin,et al. Routing, merging and sorting on parallel models of computation , 1982, STOC '82.

[9] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[10] F. Warren Burton,et al. Comment on 'the explicit quad tree as a structure for computer graphics , 1983 .

[11] Kenneth Steiglitz,et al. Operations on Images Using Quad Trees , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12] J. L. Smith,et al. A data structure and algorithm based on a linear key for a rectangle retrieval problem , 1983, Comput. Vis. Graph. Image Process..