rponnusa@rodan.acs.syr.edu (Ravi Ponnusamy) (10/23/89)
hello netters, I am interested in implementing binary/quad/octrees in the SIMD and MIMD machines. I would be grateful to you if any of you can send me about the articles/papers relevant to the above topic. thanks in advance. ravi. rponnusa@rodan.acs.syr.edu rponnusa@sunrise.bitnet
howard@aic.dpl.scg.hac.com (Mike Howard (213)317-5690) (10/25/89)
In article <6855@hubcap.clemson.edu> rponnusa@rodan.acs.syr.edu (Ravi Ponnusamy) writes: > I am interested in implementing binary/quad/octrees in the > SIMD and MIMD machines. I would be grateful to you if any of you > can send me about the articles/papers relevant to the above > topic. I haven't found much literature on parallel implementations, but here is a good one: Hung, Yubin & Azriel Rosenfield, "Parallel Processing of Linear Quadtrees on a Mesh-Connected Computer", J. Parallel and Distributed Computing, v.7, pp 1-27 (1989). It refers to Mei, G. and Liu, W. "Parallel processing for quadtree problems", Proc. Int Conf on Parallel Proc., (1986) PP. 452-4. Martin, M, Chiarulli, D. M., and Iyengar, S.S, "Parallel processing of Quadtrees on a horizontally reconfigurable architecture computing system." Proc. Int Conf on Par Proc. (1986) pp. 895-902. I haven't read the last 2. There are a couple of good articals from the 1988 Proceedings of the Hypercube conference, I forget the exact title. One is "Region Growing on a Hypercube Multi- processor", by Willebeek-LeMair and Reeves. However, theirs is not a regular tree. I'm doing a kind of quick and dirty system on the hypercube using a quadtree to represent each region in an image. I just implemented Samet's quadtree-building algorithms. His new books are just out. See esp. "Applications of Spatial Data Structures". However, they do not touch on parallel implementations. I'd like to know your application. Mike Howard, Hughes Research Labs, howard@aic.hrl.hac.com