Mesh Insertion of Hybrid Meshes
A mesh insertion method is presented to merge a tool mesh into a target mesh. All the entities of the tool mesh are preserved in the output mesh while some of the entities of the target mesh are modified or eliminated in order to obtain a topologically conforming mesh. The algorithm can handle non-manifold surfaces formed of quadrilaterals and/or triangles as well as volumetric meshes based on hexahedra, prisms, pyramids and/or tetrahedra. Lower order elements such as beams can also be taken into consideration. A robust 2-steps advancing front algorithm is introduced to fill the narrow gap between the two mesh objects to obtain a complete crack-free connection. An efficient mesh data structure is developed to optimize the search operations and the intersection tests needed by the algorithm. Several application examples are provided to show the strength of the presented algorithm.
KeywordsHybrid meshes mesh data structure advancing front methods mesh insertion
Unable to display preview. Download preview PDF.
- 4.Ito, Y., Shih, A., Soni, B.: Reliable isotropic tetrahedral mesh generation based on an advancing front method. In: 13th International Meshing Roundtable, pp. 95–105 (2004)Google Scholar
- 6.Shewchuk, J.R.: Constrained Delaunay tetrahedralizations and provably good boundary recovery. In: 11th International Meshing Roundtable, pp. 193–204 (2002)Google Scholar
- 7.Cohen-Steiner, D., Colin, E., Yvinec, M.: Conforming Delaunay triangulations in 3D. In: 18th Annual Symposium on Computational Geometry, pp. 199–208 (2002)Google Scholar
- 9.Miller, G.L., Talmor, D., Teng, S.-H., Walkington, N.: A Delaunay based numerical method for three dimensions: generation, formulation, and partition. In: 27th Annual ACM Symposium on the Theory of Computing, Las Vegas, Nevada, pp. 683–692 (1995)Google Scholar
- 10.Shewchuk, J.R.: Tetrahedral mesh generation by Delaunay refinement. In: 14th Annual Symposium on Computational Geometry, Minneapolis, Minnesota, pp. 86–95 (1998)Google Scholar
- 11.Shewchuk, J.R.: Mesh generation for domains with small angles. In: 16th Annual Symposium on Computational Geometry, Hong Kong, pp. 1–10 (2000)Google Scholar
- 12.Edelsbrunner, H., Li, X.-Y., Miller, G., Stathopoulos, A., Talmor, D., Teng, S.-H., Ungor, A., Walkington, N.: Smoothing and cleaning up slivers. In: 32nd Annual Symposium on the Theory of Computing, Portland, Oregon, pp. 273–278 (2000)Google Scholar
- 16.Staten, M.L., Owen, S.J., Blacker, T.D.: Unconstrained paving & plastering: a new idea for all hexahedral mesh generation. In: 14th International Meshing Roundtable, pp. 399–416 (2005)Google Scholar