×

Quality improvement of segmented hexahedral meshes using geometric flows. (English) Zbl 1397.65033

Zhang, Yongjie (Jessica) (ed.), Image-based geometric modeling and mesh generation. Dordrecht: Springer (ISBN 978-94-007-4254-3/hbk; 978-94-007-4255-0/ebook). Lecture Notes in Computational Vision and Biomechanics 3, 195-221 (2013).
Summary: This paper presents a new quality improvement algorithm for segmented quadrilateral/hexahedral meshes which are generated from multiple materials. The proposed algorithm combines mesh pillowing, curve and surface fairing driven by geometric flows, and optimization-based mesh regularization. The pillowing technique for quadrilateral/hexahedral meshes is utilized to eliminate doublets with two or more edges/faces located on boundary curves/surfaces. The non-manifold boundary for multiple materials is divided into several surface patches with common curves. Then curve vertices, surface vertices, and interior vertices are optimized via different strategies. Various geometric flows for surface smoothing are compared and discussed as well. Finally, the proposed algorithm is applied to three mesh datasets, the resulting quadrilateral meshes are well smoothed with volume and feature preserved, and hexahedral meshes have desirable Jacobians.
For the entire collection see [Zbl 1254.68047].

MSC:

65D18 Numerical aspects of computer graphics, image analysis, and computational geometry

Software:

LBIE
Full Text: DOI

References:

[1] 1. Bobenko E, Schröder P, Caltech T (2005) Discrete Willmore flow. In: Eurographics symposium on geometry processing, pp 101-110
[2] 2. Bryant R (1984) A duality theorem for Willmore surfaces. J Differ Geom 20:23-53 · Zbl 0555.53002
[3] 3. Canann A (1991) Plastering and optismoothing: new approaches to automated, 3D hexahedral mesh generation and mesh smoothing. PhD dissertation, Brigham Young University, Provo, UT
[4] 4. Desbrun M, Meyer M, Schröder P, Barr AH (1999) Implicit fairing of irregular meshes using diffusion and curvature flow. In: SIGGRAPH’99 proceedings of the 26th annual conference on computer graphics and interactive techniques, Los Angeles, USA, pp 317-324 · doi:10.1145/311535.311576
[5] 5. Escher J, Simonett G (1998) The volume preserving mean curvature flow near spheres. Proc Am Math Soc 126(9):2789-2796 · Zbl 0909.53043 · doi:10.1090/S0002-9939-98-04727-3
[6] 6. Field D (1988) Laplacian smoothing and Delaunay triangulation. Commun Appl Numer Methods 4:709-712 · Zbl 0664.65107 · doi:10.1002/cnm.1630040603
[7] 7. Freitag LA, Knupp PM (2002) Tetrahedral mesh improvement via optimization of the element condition number. Int J Numer Methods Eng 53:1377-1391 · Zbl 1112.74512 · doi:10.1002/nme.341
[8] 8. Freitag L, Plassmann P (2000) Local optimization-based simplicial mesh untangling and improvement. Int J Numer Methods Eng 49:109-125 · Zbl 0962.65098 · doi:10.1002/1097-0207(20000910/20)49:1/2<109::AID-NME925>3.0.CO;2-U
[9] 9. Ito Y, Shih A, Soni B (2009) Octree-based reasonable-quality hexahedral mesh generation using a new set of refinement templates. Int J Numer Methods Eng 77:1809-1833 · Zbl 1160.74425 · doi:10.1002/nme.2470
[10] 10. Knupp P (2000) Hexahedral mesh untangling and algebraic mesh quality metrics. In: Proceedings of 9th international meshing roundtable, pp 173-183
[11] 11. Knupp P (2001) Hexahedral and tetrahedral mesh untangling. Eng Comput 17:261-268 · Zbl 0983.68564 · doi:10.1007/s003660170006
[12] 12. Leng J, Zhang Y, Xu G (2011) A novel geometric flow-driven approach for quality improvement of segmented tetrahedral meshes. In: Proceedings of the 20th international meshing roundtable, pp 327-344
[13] 13. Li T, McKeag R, Armstrong C (1995) Hexahedral meshing using midpoint subdivision and integer programming. Comput Methods Appl Mech Eng 124:171-193 · doi:10.1016/0045-7825(94)00758-F
[14] 14. Mitchell S, Tautges T (1995) Pillowing doublets: refining a mesh to ensure that faces share at most one edge. In: Proceedings of the 4th international meshing roundtable, pp 231-240
[15] 15. Owen S (1998) A survey of unstructured mesh generation technology. In: Proceedings of the 7th international meshing roundtable, pp 239-267
[16] 16. Qian J, Zhang Y, Wang W, Lewis A, Siddiq Qidwai M, Geltmacher A (2010) Quality improvement of non-manifold hexahedral meshes for critical feature determination of microstructure materials. Int J Numer Methods Eng 82:1406-1423 · Zbl 1188.74094
[17] 17. Sapiro G (2001) Geometric partial differential equations and image analysis. Cambridge University Press, Cambridge · Zbl 0968.35001 · doi:10.1017/CBO9780511626319
[18] 18. Schneiders R (1996) A grid-based algorithm for the generation of hexahedral element meshes. Eng Comput 12:168-177 · doi:10.1007/BF01198732
[19] 19. Tautges T, Blacker T, Mitchell S (1996) The whisker-weaving algorithm: a connectivity based method for constructing all-hexahedral finite element meshes. Int J Numer Methods Eng 39:3327-3349 · Zbl 0884.73073 · doi:10.1002/(SICI)1097-0207(19961015)39:19<3327::AID-NME2>3.0.CO;2-H
[20] 20. Xu G (2008) Geometric partial differential equation methods in computational geometry. Science Press of China, Beijing
[21] 21. Zhang Y, Bajaj C (2006) Adaptive and quality quadrilateral/hexahedral meshing from volumetric data. Comput Methods Appl Mech Eng 195:942-960 · Zbl 1119.65013 · doi:10.1016/j.cma.2005.02.016
[22] 22. Zhang Y, Bajaj C, Sohn B (2005) 3D finite element meshing from imaging data. Comput Methods Appl Mech Eng 194:5083-5106 · Zbl 1093.65019 · doi:10.1016/j.cma.2004.11.026
[23] 23. Zhang Y, Bajaj C, Xu G (2005) Surface smoothing and quality improvement of quadrilateral/hexahedral meshes with geometric flow. In: Proceedings of the 14th international meshing roundtable, pp 449-468 · doi:10.1007/3-540-29090-7_27
[24] 24. Zhang Y, Hughes T, Bajaj C (2010) An automatic 3D mesh generation method for domains with multiple material. Comput Methods Appl Mech Eng 199:405-415 · Zbl 1227.74129 · doi:10.1016/j.cma.2009.06.007
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.