Graph-Based Fracture Models for Rigid Body Explosions
In contrast to fracture models that are based on physics, I propose a new approach to simulating fracture which treats fracturing the rigid body as a pre-processing step. A rigid body can be pre-fractured by treating it as graph and using one of the two proposed graph partitioning algorithms to divide the object into the desired number of pieces. By treating fracture as a pre-processing step, much less computation need be done during the simulation than models based on physics.
It is shown that the recursive breadth-first search graph partitioning algorithm produces physically realistic results for shattering windows that are consistent with observations of real broken windows. The curvature-driven spectral partitioning algorithm fractures objects into two pieces where the object is weakest, where weakest is defined by the area with largest curvature. Numerical simulations of explosions and fracture were conducted to produce data that was used by a ray tracer and volume renderer to create images which were assembled into animations.
School:University of Waterloo
School Location:Canada - Ontario
Source Type:Master's Thesis
Keywords:computer science natural phenomena simulation explosions fracture graph algorithms
Date of Publication:01/01/2005