Skip to main content
eScholarship
Open Access Publications from the University of California

On Embedded Methods for Crack Propagation, Virtual Surgery, Shattered Objects in Computer Animation, and Elliptic Partial Differential Equations

  • Author(s): Hellrung, Jeffrey Lee
  • Advisor(s): Teran, Joseph M
  • et al.
Abstract

We present a collection of embedded methods to solve a variety of scientific computing problems in both 2 and 3 dimensions. Embedded methods make use of a structured background mesh which does not conform to the irregular geometry, such as the domain boundary, of the problem. Instead, the irregular geometry is embedded within the structured mesh's elements, providing a framework to solve many problems involving crack propagation, progressive fracturing, dynamic interfaces, and shape optimization.

In Part I, we apply the mesh cutting algorithm of Sifakis et al. [Sifakis07] to investigate the modeling of cracks, surgical incisions, and shattering. Specifically, we present a geometrically flexible and straightforward crack propagation method which combines the eXtended Finite Element Method (XFEM) with [Sifakis07] and an innovative integration scheme which makes use of a subordinate quadrature mesh. We also discuss the application of [Sifakis07] and other advances in numerical methods to address the challenges of a virtual surgery simulator. We conclude Part I by describing a system to facilitate the modeling of cracked and shattered objects in the context of visual effects and computer animation.

In Part II, we present a numerical method utilizing virtual degrees of freedom to efficiently solve elliptic partial differential equations (specifically: Poisson's equation with interfacial jump conditions; and linear elasticity in the nearly incompressible regime) on irregular domains within a regular background Cartesian grid. Our method enforces Dirichlet boundary conditions and interfacial jump conditions weakly, formulating our system as a constrained minimization problem. In this context, we describe an algorithm to generate an associated discrete Lagrange multiplier space that allows one to derive an equivalent symmetric positive definite linear system. We provide a family of multigrid algorithms to solve this linear system with near optimal efficiency. Our method is second order accurate in L and possesses a feature set rarely found among the broad class of embedded methods for elliptic problems.

Main Content
Current View