For a collection of sets in R d 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 d . Our algorithm solves a difficult problem faced by meshfree discretizations, and is based on the sequential algorithm of Han, Oliveira, and Stewart [3].
['C. Cartwright', 'Suely Oliveira', 'David E. Stewart']
A parallel quadtree algorithm for efficient assembly of stiffness matrices in meshfree galerkin methods