David A. Stuart
ABSTRACT
Embedding high-resolution surface geometry in coarse control meshes is a standard approach to achieving high-quality computer animation at low computational expense. In this paper we present an effective, automatic method for generating such control meshes. The resulting high-quality, tetrahedral meshes enclose and approximate an input surface mesh, avoiding extrapolation artifacts and ensuring that the resulting coarse volumetric meshes are adequate collision proxies. Our approach comprises three steps: we begin with a tetrahedral mesh built from the body-centered cubic lattice that tessellates the bounding box of the input surface; we then perform a sculpting phase that carefully removes elements from the lattice; and finally a variational vertex adjustment phase iteratively adjusts vertex positions to more closely approximate the surface geometry. Our approach provides explicit trade-offs between mesh quality, resolution, and surface approximation. Our experiments demonstrate the technique can be used to build high-quality meshes appropriate for simulations within games.
- Acar, U. A., and Hudson, B. 2007. Dynamic mesh refinement with quad trees and off-centers. Tech. Rep. 121, Carnegie Mellon University School of Computer Science.Google Scholar
- Alim, U. R., Entezari, A., and Möller, T. 2009. The lattice-Boltzmann method on optimal sampling lattices. IEEE Transactions on Visualization and Computer Graphics 15, 4, 630--641. Google ScholarDigital Library
- Alliez, P., Cohen-Steiner, D., Yvinec, M., and Desbrun, M. 2005. Variational tetrahedral meshing. ACM Trans. Graph. 24, 3 (July), 617--625. Google ScholarDigital Library
- Bargteil, A. W., Goktekin, T. G., O'Brien, J. F., and Strain, J. A. 2006. A semi-Lagrangian contouring method for fluid simulation. ACM Transactions on Graphics 25, 1, 19--38. Google ScholarDigital Library
- Bern, M., and Eppstein, D. 1992. Mesh generation and optimal triangulation. Tech. Rep. 47, Xerox Palo Alto Research Center.Google Scholar
- Brochu, T., and Bridson, R. 2009. Robust topological operations for dynamic explicit surfaces. SIAM Journal on Scientific Computing 31, 4, 2472--2493. Google ScholarDigital Library
- Bronson, J., Levine, J., and Whitaker, R. 2013. Lattice cleaving: Conforming tetrahedral meshes of multimaterial domains with bounded quality. In Proceedings of the 21st International Meshing Roundtable. 191--209.Google Scholar
- Buratynski, E. K. 1990. A fully automatic three-dimensional mesh generator for complex geometries. International Journal for Numerical Methods in Engineering 30, 931--952.Google Scholar
- Capell, S., Green, S., Curless, B., Duchamp, T., and Popović, Z. 2002. Interactive skeleton-driven dynamic deformations. ACM Trans. Graph. 21, 3 (July), 586--593. Google ScholarDigital Library
- Capell, S., Green, S., Curless, B., Duchamp, T., and Popović, Z. 2002. A multiresolution framework for dynamic deformations. In Proc. of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation, 41--47. Google ScholarDigital Library
- Cgal, Computational Geometry Algorithms Library. http://www.cgal.org.Google Scholar
- Chen, L. 2004. Mesh smoothing schemes based on optimal Delaunay triangulations. In Proceedings of the 13th International Meshing Roundtable, 109--120.Google Scholar
- Cutler, B., Dorsey, J., and McMillan, L. 2004. Simplification and improvement of tetrahedral models for simulation. In Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing, 93--102. Google ScholarDigital Library
- Du, Q., and Wang, D. 2003. Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations. International Journal for Numerical Methods in Engineering 56, 9, 1355--1373.Google ScholarCross Ref
- Edelsbrunner, H., Preparata, F. P., and West, D. B. 1990. Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation 10, 3-4, 335--347. Google ScholarDigital Library
- Freitag, L. A., and Knupp, P. M. 2002. Tetrahedral mesh improvement via optimization of the element condition number. International Journal for Numerical Methods in Engineering 53, 6, 1377--1391.Google ScholarCross Ref
- Freitag, L. A., and Ollivier-gooch, C. 1997. Tetrahedral mesh improvement using swapping and smoothing. International Journal for Numerical Methods in Engineering 40, 21, 3979--4002.Google ScholarCross Ref
- Huang, J., Chen, L., Liu, X., and Bao, H. 2008. Efficient mesh deformation using tetrahedron control mesh. In Proceedings of the ACM symposium on Solid and physical modeling, 241--247. Google ScholarDigital Library
- Hudson, B., Miller, G., and Phillips, T. 2006. Sparse Voronoi refinement. In Proceedings of the 15th International Meshing Roundtable, 339--356.Google Scholar
- Klingner, B. M., and Shewchuk, J. R. 2007. Aggressive tetrahedral mesh improvement. In Proceedings of the 16th International Meshing Roundtable, 3--23.Google Scholar
- Labelle, F., and Shewchuk, J. R. 2007. Isosurface stuffing: fast tetrahedral meshes with good dihedral angles. ACM Trans. Graph. 26, 3 (July). Google ScholarDigital Library
- Li, X.-Y., Teng, S.-H., and Üngör, A. 2000. Biting: Advancing front meets sphere packing. International Journal for Numerical Methods in Engineering 49, 1, 61--81.Google ScholarCross Ref
- Liu, A., and Joe, B. 1995. Quality local refinement of tetrahedral meshes based on 8-subtetrahedron subdivision. SIAM Journal on Scientific Computing 16, 6, 1269--1291. Google ScholarDigital Library
- Mitchell, S. A., and Vavasis, S. A. 2000. Quality mesh generation in higher dimensions. SIAM Journal on Computing 29, 4, 1334--1370. Google ScholarDigital Library
- Molino, N., Bridson, R., Teran, J., and Fedkiw, R. 2003. A crystalline, red green strategy for meshing highly deformable objects with tetrahedra. In Proceedings of the 12th International Meshing Roundtable, 103--114.Google Scholar
- Molino, N., Bao, Z., and Fedkiw, R. 2004. A virtual node algorithm for changing mesh topology during simulation. ACM Trans. Graph. 23, 3 (Aug.), 385--392. Google ScholarDigital Library
- Mullen, P., Memari, P., de Goes, F., and Desbrun, M. 2011. Hot: Hodge-optimized triangulations. ACM Trans. Graph. 30, 4 (July), 103:1--103:12. Google ScholarDigital Library
- Müller, M., and Gross, M. 2004. Interactive virtual materials. In Proccedings of Graphics Interface 2004, 239--246. Google ScholarDigital Library
- Müller, M., Teschner, M., and Gross, M. 2004. Physically-based simulation of objects represented by surface meshes. In Proceedings of Computer Graphics International 2004, 26--33. Google ScholarDigital Library
- Nesme, M., Kry, P. G., Jeřábková, L., and Faure, F. 2009. Preserving topology and elasticity for embedded deformable models. ACM Trans. Graph. 28, 3 (July), 52:1--52:9. Google ScholarDigital Library
- Parker, E. G., and O'Brien, J. F. 2009. Real-time deformation and fracture in a game environment. In Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation, 156--166. Google ScholarDigital Library
- Perucchio, R., Saxena, M., and Kela, A. 1989. Automatic mesh generation from solid models based on recursive spatial decompositions. International Journal for Numerical Methods in Engineering 28, 11, 2469--2501.Google ScholarCross Ref
- Schöberl, J. 1997. NETGEN - An advancing front 2D/3D-mesh generator based on abstract rules. Computing and Visualization in Science 1, 1, 41--52.Google ScholarCross Ref
- Sederberg, T. W., and Parry, S. R. 1986. Free-form deformation of solid geometric models. SIGGRAPH Comput. Graph. 20, 4 (Aug.), 151--160. Google ScholarDigital Library
- Shen, C., O'Brien, J. F., and Shewchuk, J. R. 2004. Interpolating and approximating implicit surfaces from polygon soup. ACM Trans. Graph. 23, 3 (Aug.), 896--904. Google ScholarDigital Library
- Shephard, M. S., and Georges, M. K. 1991. Automatic three-dimensional mesh generation by the finite octree technique. International Journal for Numerical Methods in Engineering 32, 4, 709--749.Google ScholarCross Ref
- Shewchuk, J. R. 1998. Tetrahedral mesh generation by Delaunay refinement. In Proceedings of the 14th Annual Symposium on Computational Geometry, 86--95. Google ScholarDigital Library
- Shewchuk, J. R. 2002. What is a good linear element? Interpolation, conditioning, and quality measures. In Proceedings of the 11th International Meshing Roundtable, 115--126.Google Scholar
- Si, H. 2004. TetGen, a quality tetrahedral mesh generator and three-dimensional Delaunay triangulator, v1.3 users manual. Tech. Rep. 9, Weierstrass Institute for Applied Analysis and Stochastics.Google Scholar
- Sifakis, E., Shinar, T., Irving, G., and Fedkiw, R. 2007. Hybrid simulation of deformable solids. In Proceedings of the ACM SIGGRAPH/Eurographics symposium on Computer animation, 81--90. Google ScholarDigital Library
- Teran, J., Molino, N., Fedkiw, R., and Bridson, R. 2005. Adaptive physics based tetrahedral mesh generation using level sets. Engineering with Computers 21, 1, 2--18.Google ScholarDigital Library
- Tournois, J., Srinivasan, R., and Alliez, P. 2009. Perturbing slivers in 3D Delaunay meshes. In Proceedings of the 18th International Meshing Roundtable, 157--173.Google Scholar
- Tournois, J., Wormser, C., Alliez, P., and Desbrun, M. 2009. Interleaving delaunay refinement and optimization for practical isotropic tetrahedron mesh generation. ACM Trans. Graph. 28, 3 (July), 75:1--75:9. Google ScholarDigital Library
- Wojtan, C., and Turk, G. 2008. Fast viscoelastic behavior with thin features. ACM Trans. Graph. 27, 3 (Aug.), 47:1--47:8. Google ScholarDigital Library
Index Terms
- Automatic Construction of Coarse, High-Quality Tetrahedralizations that Enclose and Approximate Surfaces for Animation
Recommendations
Grid generation and optimization based on centroidal Voronoi tessellations
Centroidal Voronoi tessellations (CVTs) are Voronoi tessellations of a region such that the generating points of the tessellations are also the centroids of the corresponding Voronoi regions. Such tessellations are of use in very diverse applications, ...
Automatic domain partitioning for quadrilateral meshing with line constraints
In this paper, we present an algorithm for partitioning any given 2D domain into regions suitable for quadrilateral meshing. It is able to preserve the symmetry of the domain if any, and can deal with inner boundaries and multidomain geometries. ...
High-quality 2D mesh generation without obtuse and small angles
AbstractIn this paper, we present an efficient method to eliminate the obtuse triangles for high quality 2D mesh generation. Given an initialization (e.g., from Centroidal Voronoi Tessellation—CVT), a limited number of point insertions and ...
Comments