Abstract
There are two important problems in the context of Delaunay based mesh generation namely boundary recovery after Delaunay tetrahedralization and sliver removal. Both of them can be solved to a large extent using a new method, the so called small polyhedron reconnection or SPR for abbreviation. For sliver remove, an operation is developed according to the idea of SPR, which seeks for the optimal tetrahedralization of a polyhedron with a certain number of vertexes and faces (typically composed of 20 to 40 tetrahedral elements). The SPR operation is quite effective in the improvement of mesh quality and more suitable than elementary flips when combined with smoothing approach. For boundary recovery, two other operations are developed: 1) create a segment in the mesh and 2) remove a segment from the mesh. Both operations are special cases of the general SPR operation with extra geometrical constrains and they can be used to recover boundaries after Delaunay triangulation without inserting extra nodes.
In this paper the SPR and its application will be introduced, then some recently improvement on its time efficiency is presented.
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.
Similar content being viewed by others
References
Liu JF, Sun SL, Wang DC. Optimal tetrahedralization for small polyhedron: a new local transformation strategy for 3-D mesh generation and mesh improvement. CMES: Computer Modeling in Engineering & Sciences, 2006; 14(1): 31–43.
Liu JF, Sun SL. Small polyhedron reconnection: a new way to eliminate poorly-shaped tetrahedral. Proceedings of 15th international meshing roundtable, Birmingham, USA, 2006.
Liu JF, Chen Bin. Boundary recovery after 3D Delaunay tetrahedralization without adding extra nodes. Int. J. Numer. Meth. Engrg, 2007 (in press, DOI: 10.1002/nme.2044).
Lo SH. Optimization of tetrahedral meshes based on element shape measures. Comput. & Struct., 1997; 63(5): 951–961.
Joe B. Construction of 3-dimensional improved-quality triangulations using local transformations. SIAM. J. Sci. Comput., 1995; 16(6): 1292–1307.
George PL, Borouchaki H. Back to edge flips in 3 dimensions. In: Proc. 12th International Meshing Roundtable, Sandia National Laboratories, USA, 2003, pp. 393–402.
Kennon SR, Dulikravich GS. Generation of computational grids using optimization. AIAA J., 1986; 24(7): 1069–1073.
Zhang H, Trepanier JY. An algorithm for the optimization of directionally stretched triangulations. Int. J. Numer. Meth. Engrg, 1994; 37(9): 1481–1497.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2007 Tsinghua University Press & Springer
About this paper
Cite this paper
Liu, J., Sun, S., Chen, Y. (2007). SPR — A New Method for Mesh Improvement and Boundary Recovery. In: Computational Mechanics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75999-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-75999-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75998-0
Online ISBN: 978-3-540-75999-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)