Abstract
Automatic generation of hexahedral meshes for complex geometries is still a challenging problem, the domain-decomposition based method is one of the promising methods for such problems. When generating the meshes of sub-components of a domain, it is often necessary to impose consistent mesh constraints on the interfaces between sub-components. The adoption of mesh matching algorithms can relax such constraints, and improve the efficiency and robustness of mesh generation framework. In this paper, a new mesh matching algorithm based on base-complex structure is proposed. In our method, the base-complex structures of the sub-components to be matched are obtained and optimized first, and then they are used to match the interfaces between the sub-components via dual chord operations on the base-complex structures. After the matching process, an optimization problem is formulated and solved to adjust the positions of corresponding vertices on the interfaces. Compared to the current mesh matching algorithms, instead of performing dual operations directly on mesh elements, the proposed method needs less dual operations and is able to obtain higher quality elements near the interfaces. Finally, the effectiveness of the proposed algorithm is verified by several matching examples.
Similar content being viewed by others
Data availability
Data will be made available on request.
References
Hang S (2015) TetGen, a Delaunay-based quality tetrahedral mesh generator. Acm Trans Math Softw 41(2):11
Shepherd JF et al (2008) Hexahedral mesh generation constraints. Eng Comput 24(3):195–213
Cherchi G, Alliez P, Scateni R (2019) Selective padding for polycube-based hexahedral meshing. Computer graphics forum 38(1):580–591
Guo HX, Liu Y et al (2020) Cut-enhanced PolyCube-maps for feature-aware all-hex meshing. ACM Trans Graph 39(4):106–1
Yu Y, Liu JG, Zhang Y (2022) HexDom: polycube-based hexahedral-dominant mesh generation. In: Mesh generation and adaptation: cutting-edge techniques. Cham: Springer International Publishing, pp 137–155
Yu Y, Wei X, Li A et al (2022) HexGen and Hex2Spline: polycube-based hexahedral mesh generation and spline modeling for isogeometric analysis applications in LS-DYNA. In: Geometric challenges in isogeometric analysis. Cham: Springer International Publishing, pp 333–363
Gao X, Shen H, Panozzo D (2019) Feature preserving octree-based hexahedral meshing. Comput Graph Forum 38(5):135–149
Hu K, Zhang Y (2016) Centroidal Voronoi tessellation based polycube construction for adaptive all-hexahedral mesh generation. Comput Methods Appl Mech Eng 305:405–421
Livesu M, Pitzalis L, Cherchi G (2021) Optimal dual schemes for adaptive grid based hexmeshing. ACM Trans Graph 41(2):1–14
Zhang Yongjie, Bajaj Chandrajit (2006) Adaptive and quality quadrilateral/hexahedral meshing from volumetric data. Comput Methods Appl Mech Eng 195(9–12):942–960
Zhang Y, Hughes TJR, Bajaj CL (2010) An automatic 3D mesh generation method for domains with multiple materials. Comput Methods Appl Mech Eng 199(5–8):405–415
Qian J, Zhang Y, Wang W et al (2010) Quality improvement of non-manifold hexahedral meshes for critical feature determination of microstructure materials. Int J Numer Methods Eng 82(11):1406–1423
Zhang YJ (2018) Geometric modeling and mesh generation from scanned images. CRC Press
Kowalski N, Ledoux F, Frey P (2014) Block-structured hexahedral meshes for CAD models using 3d frame fields. Proc Eng 82:59–71
Qian J, Zhang Y (2012) Automatic unstructured all-hexahedral mesh generation from B-Reps for non-manifold CAD assemblies. Eng Comput 28:345–359
Jankovich SR, Benzley SE, Shepherd JF et al (1999) The Graft Tool: an all-hexahedral transition algorithm for creating a multi-directional swept volume mesh. Surfaces 5:6
Staten ML, Shepherd JF, Shimada K (2008) Mesh matching–creating conforming interfaces between hexahedral meshes. In: Proceedings of the 17th International Meshing Roundtable, pp 467–484
Chen J, Gao S, Zhu H (2016) An improved hexahedral mesh matching algorithm. Eng Comput 32(2):207–230
Chen J, Gao S, Wang R et al (2016) An approach to achieving optimized complex sheet inflation under constraints. Comput Graph 59:39–56
Borden MJ, Benzley SE, Shepherd JF (2002) Hexahedral sheet extraction. In: Proceedings of the 11th International Meshing Roundtable, pp 147–152
Ledoux F, Shepherd JF (2010) Topological modifications of hexahedral meshes via sheet operations: a theoretical study. Eng Comput 26(4):433–447
Merkley K, Ernst C, Shepherd JF et al (2008) Methods and applications of generalized sheet insertion for hexahedral meshing. In: Proceedings of the 16th International Meshing Roundtable, pp 233–250
Xu G, Ling R, Zhang YJ, Xiao Z, Ji Zg, Rabczuk T (2021) Singularity structure simplification of hexahedral meshes via weighted ranking. Comput-Aided Des 130:102946
Gao X, Deng Z, Chen G (2015) Hexahedral mesh re-parameterization from aligned base-complex. ACM Trans Graph 34(4):1–10
Gao X, Panozzo D, Wang W et al (2017) Robust structure simplification for hex re-meshing. ACM Trans Graph 36(6):1–13
Rabinovich M, Poranne R, Panozzo D et al (2017) Scalable locally injective mappings. ACM Trans Graph 36(4):1
Mitchell SA, Tautges TJ (1995) Pillowing doublets: refining a mesh to ensure that faces share at most one edge. Proceedings of the 4th International Meshing Roundtable
Smith J, Schaefer S (2015) Bijective parameterization with free boundaries. ACM Trans Graph 34(4):1–9
Livesu M, Sheffer A, Vining N et al (2015) Practical hex-mesh optimization via edge-cone rectification. ACM Trans Graph 34(4):1–11
Wu H, Gao S, Wang R et al (2017) A global approach to multi-axis swept mesh generation. Proc Eng 203:414–426
Funding
This research was supported by the National Key R &D Program of China under Grant No.2020YFB1709402, the Zhejiang Provincial Science and Technology Program in China under Grant 2021C01108, the National Natural Science Foundation of China (No.U22A2033, 62202130, U1909210), the Zhejiang Provincial Science and Technology Program in China (No.LQ22F020026), and the Open project of State Key Laboratory of CAD & CG at Zhejiang University (No.A2212).
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
Conflict of interest
The authors have no competing interests to declare that are relevant to the content of this article.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Zhao, Q., Xu, G., Xiao, Z. et al. Bc-hexmatching: an improved hexahedral mesh matching approach based on base-complex structure. Engineering with Computers 40, 2209–2226 (2024). https://doi.org/10.1007/s00366-023-01908-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00366-023-01908-6