Parallel Quadtree Construction and Manipulation Algorithms on Hypercubes
نویسندگان
چکیده
In this paper we introduce efficient parallel quadtree construction and manipulation algorithms on hypercube multiprocessors. The notion of extended binomial tree is introduced to represent the distributed quadtree structure on a hypercube. By incorporating the geometric property into the distributed quadtree structure, we devise a data assignment scheme which satisfies the multi-level adjacency preserving (MAP) property. We show that the distributed data structure together with geometric constraint not only results in an efficient parallel quadtree construction, but also facilitates several graphics and image processing operations, such as neighbor finding, perimeter computation and border extraction, on constructed quadtree. Theoretical analysis and empirical testing are given to show that the proposed algorithms are better than existing algorithms both in time and communication aspects.
منابع مشابه
Parallel Processing of Pointer Based Quadtrees on Hypercube Multiprocessors
This paper studies the parallel construction and manipulation of pointer based quadtrees on the hypercube multiprocessor. While parallel algorithms for the manipulation of a variant of linear quadtrees have been previously studied in the literature, no parallel pointer based quadtree construction algorithms have been presented. In this paper, we solve the problem of efficiently constructing poi...
متن کاملA New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making desirable fast simulations of binary trees on hypercubes. In this paper, we present a simple one-to-one embedding of arbitrary binary trees into their optimal hypercubes with dilation 8 and constant congestion. The nov...
متن کاملSpanners for Geometric Intersection Graphs
Efficient algorithms are presented for constructing spanners in geometric intersection graphs. For a unit ball graph in R, a (1+ǫ)-spanner with O(nǫ) edges is obtained using efficient partitioning of the space into hypercubes and solving bichromatic closest pair problems. The spanner construction has almost equivalent complexity to the construction of Euclidean minimum spanning trees. The resul...
متن کاملParallel Construction of Quadtrees and Quality Triangulations
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(logn) for point set input and O(logn log k) time for planar straight-line graphs, using O(n+k/ logn) processors, where n measures input size and k output size.
متن کاملParallel quadtree construction on collections of objects
We present a parallel quadtree algorithm that resolves between geometric objects, modeling space between objects rather than the objects themselves. Our quadtree has the property that no cell intersects more than one labeled object. A popular technique for discretizing space is to impose a uniform grid – an approach that is easily parallelizable but often fails because object separation isn’t k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007