Efficient searching in meshfree methods
- 109 Downloads
Meshfree methods such as the Reproducing Kernel Particle Method and the Element Free Galerkin method have proven to be excellent choices for problems involving complex geometry, evolving topology, and large deformation, owing to their ability to model the problem domain without the constraints imposed on the Finite Element Method (FEM) meshes. However, meshfree methods have an added computational cost over FEM that come from at least two sources: increased cost of shape function evaluation and the determination of adjacency or connectivity. The focus of this paper is to formally address the types of adjacency information that arises in various uses of meshfree methods; a discussion of available techniques for computing the various adjacency graphs; propose a new search algorithm and data structure; and finally compare the memory and run time performance of the methods.
KeywordsMeshfree Reproducing Kernel Particle Method Acceleration data structure Nearest neighbour Adjacency Connectivity
The authors would like to thank and acknowledge Dr. Jen Bright for the data provided for the Scarlet Macaw bird skull. The author’s would also like to thank Formerics, LLC for the use of their software.
- 6.Bentley JL (1975b) A survey of techniques for fixed radius near neighbor searching. Technical report, Stanford Linear Accelerator Center, Stanford, CA, USAGoogle Scholar
- 10.Chartrand G (1985) Introductory graph theory. Dover, New YorkGoogle Scholar
- 16.Fujimoto A, Iwata K (1985) Accelerated ray tracing. Springer, Tokyo, pp 41–65Google Scholar
- 22.Liu G (2009) Meshfree methods moving beyond the finite element method. CRC Press, Boca RatonGoogle Scholar