Abstract
In this paper we propose a simple technique for tetrahedral mesh improvement without inserting Steiner vertices, concentrating mainly on boundary conforming meshes. The algorithm makes local changes to the mesh to remove tetrahedra which are poor according to some quality criterion. While the algorithm is completely general with regard to quality criterion, we target improvement of the dihedral angle. The central idea in our algorithm is the introduction of a new local operation called multi-face retriangulation (MFRT) which supplements other known local operations. Like in many previous papers on tetrahedral mesh improvement, our algorithm makes local changes to the mesh to reduce an energy measure which reflects the quality criterion. The addition of our new local operation allows us to advance the mesh to a lower energy state in cases where no other local change would lead to a reduction. We also make use of the edge collapse operation in order to reduce the size of the mesh while improving its quality. With these operations, we demonstrate that it is possible to obtain a significantly greater improvement to the worst dihedral angles than using the operations from the previous works, while keeping the mesh complexity as low as possible.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amenta, N., Bern, M., Eppstein, D.: Optimal point placement for mesh smoothing. In: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, pp. 528–537. Society for Industrial and Applied Mathematics, Philadelphia (1997)
Chen, L., Xu, J.: Optimal delaunay triangulation. J. Comp. Math. 22, 299–308 (2004)
Chew, L.P.: Guaranteed-quality delaunay meshing in 3d (short version). In: Proceedings of the thirteenth annual symposium on Computational geometry, pp. 391–393. ACM, New York (1997)
Cutler, B., Dorsey, J., McMillan, L.: Simplification and improvement of tetrahedral models for simulation. In: SGP 2004: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing, pp. 93–102. ACM, New York (2004)
de Cougny, H.L., Shephard, M.S.: Refinement, derefinement and optimization of tetrahedral geometric triangulations in three dimensions (1995) (Unpublished manuscript)
Du, Q., Wang, D.: Tetrahedral mesh generation and optimization based on centroidal voronoi tessellations. Int. J. Numer. Meth. Eng 56, 1355–1373 (2002)
Freitag, L.A.: On combining laplacian and optimization-based mesh smoothing techniques. In: Trends in Unstructured Mesh Generation, pp. 37–43 (1997)
Freitag, L.A., Jones, M., Plassmann, P.: An efficient parallel algorithm for mesh smoothing. In: Proceedings of the Fourth International Meshing Roundtable (1995)
Freitag, L.A., Ollivier-Gooch, C.: Tetrahedral mesh improvement using swapping and smoothing. International Journal for Numerical Methods in Engineering 40, 3979–4002 (1997)
Hansen, M.F., Bærentzen, J.A., Larsen, R.: Generating quality tetrahedral meshes from binary volumes. In: Proceedings of VISAPP 2009 (2009)
Klincsek, G.T.: Minimal triangulations of polygonal domains. Annals of Discrete Mathematics 9, 121–123 (1980)
Klingner, B.M., Shewchuk, J.R.: Agressive tetrahedral mesh improvement. In: Proceedings of the 16th International Meshing Roundtable, October 2007, pp. 3–23 (2007)
Labelle, F., Shewchuk, J.R.: Isosurface stuffing: Fast tetrahedral meshes with good dihedral angles. ACM Transactions on Graphics 26(3), 57 (2007)
Liu, J., Sun, S.: Small polyhedron reconnection: A new way to eliminate poorly-shaped tetrahedra. In: Proceedings of the 15th International Meshing Roundtable, pp. 241–257 (2006)
Molino, N., Bridson, R., Teran, J., Fedkiw, R.: A crystalline, red green strategy for meshing highly deformable objects with tetrahedra. In: Proc. International Meshing Roundtable (2003)
Möller, P., Hansbo, P.: On advancing front mesh generation in three dimensions. International Journal for Numerical Methods in Engineering 38(21), 3551–3569 (1995)
Natarajan, V., Edelsbrunner, H.: Simplication of three-dimensional density maps. IEEE Transactions on Visualization and Computer Graphics 10, 587–597 (2004)
Parthasarathy, V.N., Graichen, C.M., Hathaway, A.F.: A comparison of tetrahedron quality measures. Finite Elements in Analysis and Design 15(3), 255–261 (1994)
Shewchuk, J.R.: Tetrahedral mesh generation by Delaunay refinement. In: Proceedings of the fourteenth annual symposium on Computational geometry, pp. 86–95. ACM, New York (1998)
Shewchuk, J.R.: Two discrete optimization algorithms for the topological improvement of tetrahedral meshes (Unpublished manuscript) (2002)
Shewchuk, J.R.: What is a good linear finite element? interpolation, conditioning, anisotropy, and quality measures (2002) (Unpublished manuscript)
Si, H.: Tetgen, a quality tetrahedral mesh generator and three-dimensional delaunay triangulator, v1.3 user’s manual. Technical report, WIAS (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Misztal, M.K., Bærentzen, J.A., Anton, F., Erleben, K. (2009). Tetrahedral Mesh Improvement Using Multi-face Retriangulation. In: Clark, B.W. (eds) Proceedings of the 18th International Meshing Roundtable. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04319-2_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-04319-2_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04318-5
Online ISBN: 978-3-642-04319-2
eBook Packages: EngineeringEngineering (R0)