One-to-one sweeping based on harmonic S-T mappings of facet meshes and their cages
The sweeping algorithm is one of the most robust techniques to generate hexahedral meshes. During one-to-one sweeping, the most difficult thing is to map an all-quad source surface mesh onto its target surface. In this paper, a harmonic function is used to map meshes from a source surface to its target surface. The result shows that it can generate an all-quad mesh on the target surface with good mesh quality for the convex, concave or multiply-connected surface and thus avoid expensive smoothing algorithm (untangling). Meanwhile, the cage-based deformation method is used to locate interior nodes between the source and target surface during sweeping. Finally, examples are provided and the execution time for our proposed algorithm is discussed.
one-to-one sweeping harmonic hexahedral mesh generation