A crystalline, red green strategy for meshing highly deformable objects with tetrahedra
Molino, Neil, Robert Bridson, Joseph Teran and Ronald Fedkiw
Proceedings, 12th International Meshing Roundtable, Sandia National Laboratories, pp.103-114, Sept. 2003
12th International Meshing Roundtable
September 14-17, 2003
Santa Fe, New Mexico, U.S.A.
Stanford University, Stanford, CA, U.S.A.
Motivated by Lagrangian simulation of elastic deformation, we propose a new tetrahedral mesh generation algorithm
that produces both high quality elements and a mesh that is well conditioned for subsequent large deformations. We
use a signed distance function defined on a Cartesian grid in order to represent the object geometry. After tiling space
with a uniform lattice based on crystallography, we use the signed distance function or other user defined criteria to
guide a red green mesh subdivision algorithm that results in a candidate mesh with the appropriate level of detail.
Then, we carefully select the nal topology so that the connectivity is suitable for large deformation and the mesh
approximates the desired shape. Finally, we compress the mesh to tightly fit the object boundary using either masses
and springs, the nite element method or an optimization approach to relax the positions of the nodes. The resulting
mesh is well suited for simulation since it is highly structured, has robust topological connectivity in the face of large
deformations, and is readily refined if deemed necessary during subsequent simulation.
Download Full Paper (PDF Format)
Contact author(s) or publisher for availability and copyright information on above referenced article