Graphical modeling and animation of brittle fracture

O’Brien, James F.; Hodgins, Jessica K.

doi:10.1145/311535.311550

Cited by 319 publications

(268 citation statements)

References 7 publications

Supporting

Mentioning

267

Contrasting

Unclassified

Order By: Relevance

“…These conventional elements are well established and allow for simple and efficient implementations. However, they require complex remeshing when it comes to adaptive refinement, merging, cutting, or fracturing, i.e., general topological changes of the simulation domain [26,27,46,45,8,44].…”

Section: Introductionmentioning

confidence: 99%

Optimizing Voronoi Diagrams for Polygonal Finite Element Computations

Sieger

Alliez

Botsch

2010

Proceedings of the 19th International Meshing Roundtable

View full text Add to dashboard Cite

Summary. We present a 2D mesh improvement technique that optimizes Voronoi diagrams for their use in polygonal finite element computations. Starting from a centroidal Voronoi tessellation of the simulation domain we optimize the mesh by minimizing a carefully designed energy functional that effectively removes the major reason for numerical instabilities-short edges in the Voronoi diagram. We evaluate our method on a 2D Poisson problem and demonstrate that our simple but effective optimization achieves a significant improvement of the stiffness matrix condition number.

show abstract

Section: Introductionmentioning

confidence: 99%

Optimizing Voronoi Diagrams for Polygonal Finite Element Computations

Sieger

Alliez

Botsch

2010

Proceedings of the 19th International Meshing Roundtable

View full text Add to dashboard Cite

show abstract

“…According to [FL01,Sec. 5.1], it is "the most complicated yet accurate method" to define the extent of intersection, which was also reported earlier by [OH99,Sec. 3.3].…”

Section: A Main Contributionsmentioning

confidence: 61%

Inner sphere trees for proximity and penetration queries

Weller¹,

Zachmann²

2009

Robotics: Science and Systems V

View full text Add to dashboard Cite

Abstract-We present a novel geometric data structure for approximate collision detection at haptic rates between rigid objects. Our data structure, which we call inner sphere trees, supports different kinds of queries, namely, proximity queries and a new method for interpenetration computation, the penetration volume, which is related to the water displacement of the overlapping region and, thus, corresponds to a physically motivated force.The main idea is to bound objects from the inside with a set of non-overlapping spheres. Based on such sphere packings, a "inner bounding volume hierarchy" can be constructed. In order to do so, we propose to use an AI clustering algorithm, which we extend and adapt here.The results show performance at haptic rates both for proximity and penetration volume queries for models consisting of hundreds of thousands of polygons.

show abstract

“…Re-meshing provides an accurate representation of the cut surface, although it produces mesh fragmentation that can be only partially alleviated by enhancing the re-meshing strategy with on-the-fly edge collapse operations [8] or by adopting a combination of these techniques [24]. O'Brien et al proposed a solution for modeling brittle and ductile fractures [18,17] in off-line simulations. They used continuum mechanics equations to derive the crack surface and mass lumping to provide an explicit integration scheme.…”

Section: Cuts On Mesh Based Modelsmentioning

confidence: 99%

“…They used continuum mechanics equations to derive the crack surface and mass lumping to provide an explicit integration scheme. In their method re-meshing is used to accurately represent the crack surface, since "approximating it with the existing element boundaries would create undesirable artifacts" [18]. Recent solutions decouple the simulation from the representation.…”

Section: Cuts On Mesh Based Modelsmentioning

confidence: 99%

Splitting cubes: a fast and robust technique for virtual cutting

Pietroni¹,

Ganovelli

Cignoni

et al. 2008

Vis Comput

View full text Add to dashboard Cite

This paper presents the Splitting Cubes, a fast and robust technique to perform interactive virtual cutting on deformable objects.The technique relies on two ideas. The first one is to embed the deformable object in a regular grid, to apply the deformation function to the grid nodes and to interpolate the deformation inside each cell from its 8 nodes. The second idea is to produce a tessellation for the boundary of the object on the base of the intersections of such boundary with the edges of the grid. Please note that the boundary can be expressed in any way, for example it can be a triangle mesh, an implicit or a parametric surface. The only requirement is that the intersection between the boundary and the grid edges can be computed. This paper shows how the interpolation of the deformation inside the cells can be used to produce discontinuities in the deformation function, and the intersections of the cut surface can be used to visually show the cuts on the oject.The Splitting Cubes is essentially a tessellation algorithm for growing, deformable surface and it can be applied to any method for animating deformable objects. In this paper the case of the mesh-free methods (MMs) is considered: in this context, we decribed a practical GPU friendly method, that we named the Extended Visibility criterion, to introduce discontinuities of the deformation.

show abstract

Graphical modeling and animation of brittle fracture

Cited by 319 publications

References 7 publications

Optimizing Voronoi Diagrams for Polygonal Finite Element Computations

Optimizing Voronoi Diagrams for Polygonal Finite Element Computations

Inner sphere trees for proximity and penetration queries

Splitting cubes: a fast and robust technique for virtual cutting

Contact Info

Product

Resources

About