Fast arbitrary splitting of deforming objects

  • Authors:
  • Denis Steinemann;Miguel A. Otaduy;Markus Gross

  • Affiliations:
  • Computer Graphics Laboratory, ETH Zurich, Switzerland;Computer Graphics Laboratory, ETH Zurich, Switzerland;Computer Graphics Laboratory, ETH Zurich, Switzerland

  • Venue:
  • Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a novel algorithm for efficiently splitting deformable solids along arbitrary piecewise linear crack surfaces in cutting and fracture simulations. We propose the use of a meshless discretization of the deformation field, and a novel visibility graph for fast update of shape functions in meshless discretizations. We decompose the splitting operation into a first step where we synthesize crack surfaces as triangle meshes, and a second step where we use the newly synthesized surfaces to update the visibility graph, and thus the meshless discretization of the deformation field. The separation of the splitting operation into two steps, along with our novel visibility graph, enables high flexibility and control over the splitting trajectories, provides fast dynamic update of the meshless discretization, and facilitates an easy implementation, making our algorithm scalable, versatile, and suitable for a large range of applications, from computer animation to interactive medical simulation.