Fatigue crack growth analysis by an enriched meshless method
Journal of Computational and Applied Mathematics - Special issue: Selected papers from the 2nd international conference on advanced computational methods in engineering (ACOMEN2002) Liege University, Belgium, 27-31 May 2002
Signed Distance Computation Using the Angle Weighted Pseudonormal
IEEE Transactions on Visualization and Computer Graphics
3D Distance Fields: A Survey of Techniques and Applications
IEEE Transactions on Visualization and Computer Graphics
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Review: Meshless methods: A review and computer implementation aspects
Mathematics and Computers in Simulation
A fast object-oriented Matlab implementation of the Reproducing Kernel Particle Method
Computational Mechanics
Hi-index | 0.00 |
Distance fields are scalar functions defining the minimum distance of a given point in the space from the boundary of an object. Crack surfaces are geometric entities whose shapes can be arbitrary, often described with ruled surfaces or polygonal subdivisions. The derivatives of distance functions for such surfaces are discontinuous across the surface, and continuous all around the edges. These properties of the distance function were employed to build intrinsic enrichments of the underlying mesh-free discretisation for efficient simulation of three-dimensional crack propagation, removing the limitations of existing criteria (reviewed in this paper). Examples show that the proposed approach is able to introduce quite convoluted crack paths. The incremental nature of the developed approach does not require re-computation of the enrichment for the entire crack surface as advancing crack front extends incrementally as a set of connected surface facets. The concept is based on purely geometric representation of discontinuities thus addressing only the kinematic aspects of the problem, such to allow for any constitutive and cohesive interface models to be used.