This Article 
 Bibliographic References 
 Add to: 
Proceedings of the 1999 ACM/IEEE conference on Supercomputing
A Unifying Data Structure for Hierarchical Methods
Portland, Oregon, USA
November 13-November 18
ISBN: 1-58113-091-0
Fatih Sevilgen, Syracuse Univeristy
Srinivas Aluru, Iowa State University
We present a data structure for supporting the access patterns required by most scientific applications that employ hierarchical methods. The data structure, termed the Distribution Independent Adaptive Tree, efficiently supports both grid-based and particle-based methods. We present efficient algorithms for most access patterns encountered in such applications: particle insertion/deletion/splitting, grid cell insertion/deletion, nearest neighbor queries, spherical region queries and computing long-range interactions. Apart from being an efficient data structure for an individual hierarchical method, the data structure is useful in applications that involve simultaneous application of multiple methods.
Fatih Sevilgen, Srinivas Aluru, "A Unifying Data Structure for Hierarchical Methods," sc, pp.24, Proceedings of the 1999 ACM/IEEE conference on Supercomputing, 1999
Usage of this product signifies your acceptance of the Terms of Use.