Efficient searching in meshfree methods

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.

[1]  Ignacio Romero,et al.  A new approach for the solution of the neighborhood problem in meshfree methods , 2017, Engineering with Computers.

[2]  E. Oñate,et al.  A FINITE POINT METHOD IN COMPUTATIONAL MECHANICS. APPLICATIONS TO CONVECTIVE TRANSPORT AND FLUID FLOW , 1996 .

[3]  Ted Belytschko,et al.  A meshfree contact-detection algorithm , 2001 .

[4]  Jiun-Shyan Chen,et al.  An arbitrary order variationally consistent integration for Galerkin meshfree methods , 2013 .

[5]  Aaron Knoll,et al.  Ray tracing animated scenes using coherent grid traversal , 2006, SIGGRAPH 2006.

[6]  Holger Wendland,et al.  Scattered Data Approximation: Conditionally positive definite functions , 2004 .

[7]  Guirong Liu.  Mesh Free Methods: Moving Beyond the Finite Element Method , 2002 .

[8]  Roberto Cavoretto,et al.  Efficient computation of partition of unity interpolants through a block-based searching technique , 2016, Comput. Math. Appl..

[9]  Wing Kam Liu,et al.  Reproducing kernel particle methods for structural dynamics , 1995 .

[10]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[11]  Ted Belytschko,et al.  Numerical integration of the Galerkin weak form in meshfree methods , 1999 .

[12]  Turner Whitted,et al.  A 3-dimensional representation for fast rendering of complex scenes , 1980, SIGGRAPH '80.

[13]  Wing Kam Liu,et al.  Meshfree and particle methods and their applications , 2002 .

[14]  C. CARTWRIGHT,et al.  Parallel Support Set Searches for Meshfree Methods , 2006, SIAM J. Sci. Comput..

[15]  Mark A Fleming,et al.  Smoothing and accelerated computations in the element free Galerkin method , 1996 .

[16]  Wing Kam Liu,et al.  Reproducing kernel particle methods , 1995 .

[17]  T. Belytschko,et al.  Element‐free Galerkin methods , 1994 .

[18]  G. Chartrand.  Introductory Graph Theory , 1984 .

[19]  S. Atluri,et al.  A new Meshless Local Petrov-Galerkin (MLPG) approach in computational mechanics , 1998 .

[20]  Sihong Shao,et al.  Efficient Implementation of Smoothed Particle Hydrodynamics (SPH) with Plane Sweep Algorithm , 2016 .

[21]  Oden,et al.  An h-p adaptive method using clouds , 1996 .

[22]  Suely Oliveira,et al.  Finding Sets Covering a Point with Application to Mesh-Free Galerkin Methods , 2000, SIAM J. Comput..

[23]  Jiun-Shyan Chen,et al.  A stabilized conforming nodal integration for Galerkin mesh-free methods , 2001 .

[24]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[25]  M. Papadrakakis,et al.  GPU-acceleration of stiffness matrix calculation and efficient initialization of EFG meshless methods , 2013 .

[26]  Gui-Rong Liu,et al.  An adaptive procedure based on background cells for meshless methods , 2002 .

[27]  Kansei Iwata,et al.  Accelerated Ray Tracing , 1985 .

[28]  M. Meo,et al.  A fast object-oriented Matlab implementation of the Reproducing Kernel Particle Method , 2012 .

[29]  Huafeng Liu,et al.  Meshfree Particle Methods , 2004 .

[30]  J. Bentley.  A survey of techniques for fixed radius near neighbor searching. , 1975 .