The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2001)
San Francisco, California, USA
Apr. 23, 2001 to Apr. 27, 2001
ISSN: 1530-2075
ISBN: 0-7695-0990-8
pp: 30118a
ABSTRACT
For a collection of sets in R<sup>d</sup> we consider the task of finding all sets in the collection that contain a given point. The parallel algorithm introduced in this paper is based on quadtrees and their generalizations to R<sup>d</sup>. Our algorithm solves a difficult problem faced by meshfree discretizations, and is based on the sequential algorithm of Han, Oliveira, and Stewart [3].
INDEX TERMS
null
CITATION
S. Oliveira, C. Cartwright, D.E. Stewart, "A parallel quadtree algorithm for efficient assembly of stiffness matrices in meshfree Galerkin methods", Parallel and Distributed Processing Symposium, International, vol. 03, no. , pp. 30118a, 2001, doi:10.1109/IPDPS.2001.925092
82 ms
(Ver 3.3 (11022016))