Fracture and fragmentation of simplicial finite element meshes using graphs

Authors:

Abstract
An approach for the topological representation of simplicial finite element meshes as graphs is presented. It is shown that by using a graph, the topological changes induced by fracture reduce to a few, local kernel operations. The performance of the graph representation is demonstrated and analyzed, using as reference the three‐dimensional fracture algorithm by Pandolfi and Ortiz (Eng. Comput. 1998; 14(4):287–308). It is shown that the graph representation initializes in O(N) time and fractures in O(N) time, while the reference implementation requires O(N) time to initialize and O(N) time to fracture, where NE is the number of elements in the mesh and NI is the number of interfaces to fracture. Copyright © 2007 John Wiley & Sons, Ltd.

This publication has 32 references indexed in Scilit: