Topic
Meshfree methods
About: Meshfree methods is a research topic. Over the lifetime, 2216 publications have been published within this topic receiving 69596 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this paper, a smooth particle hydrodynamics (SPH) based numerical technique is developed to investigate the mechanical properties and evolution of debonding process in particulate composites.
21 citations
TL;DR: In this article, the mathematical and numerical implementation of the Arbitrary Eulerian Lagrangian (ALE) formulation and the contact algorithm are described, in order to validate the ALE algorithms, and prove its ability for civil engineering applications.
21 citations
TL;DR: In this paper, the weighted orthogonal basis functions are applied in IIMLS to obtain a diagonal moment matrix, which can overcome the difficulty caused by directly inversing singular or ill-conditioned matrices.
21 citations
TL;DR: A geometry-based automatic pre-processing environment for the method of finite spheres is reported; a truly meshfree numerical technique developed for the solution of boundary value problems on geometrically complex domains.
21 citations
TL;DR: The resulting thinning algorithm is meshfree, i.e., its performance is solely based upon the geometry of the input 3D surface point-samples, and so it does not require any further topological information, such as point connectivities.
Abstract: An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D point-samples is proposed. The data reduction relies on a recursive point removal algorithm, termed thinning, which outputs a data hierarchy of point-samples for multiresolution surface approximation. The thinning algorithm works with a point removal criterion, which measures the significances of the points in their local neighbourhoods, and which removes a least significant point at each step. For any point x in the current point set Y⊂X, its significance reflects the approximation quality of a local surface reconstructed from neighbouring points in Y. The local surface reconstruction is done over an estimated tangent plane at x by using radial basis functions. The approximation quality of the surface reconstruction around x is measured by using its maximal deviation from the given point-samples X in a local neighbourhood of x. The resulting thinning algorithm is meshfree, i.e., its performance is solely based upon the geometry of the input 3D surface point-samples, and so it does not require any further topological information, such as point connectivities. Computational details of the thinning algorithm and the required data structures for efficient implementation are explained and its complexity is discussed. Two examples are presented for illustration.
21 citations