23rd International Meshing Roundtable
University of Wisconsin-Madison, Madison, WI, U.S.A.
CD-adapco, 1500 Engineering Drive, Madison, WI 53706, U.S.A
One of the most robust and widely used algorithms for all-hexahedral meshes is the sweeping algorithm. However, for multisweeping,
the most dicult problems are the surface matching and interval assignment for edges on the source and target surfaces.
In this paper, a new method to generate surface meshes by imprinting edge patches between the source and target surfaces is
proposed. The edge patch imprinting is based on a cage-based morphing of edge patches on the dierent sweeping layers where
deformed and undeformed cages are extracted by propagating edge patches on the linking surfaces. The imprinting results in that
the source or target surfaces will be partitioned with the imprinted edge patches. After partitioning, every new source surface
should be matched to a new specific target surface where surface mesh projection from one-to-one sweeping based on harmonic
mapping can be applied. In addition, 3D edge patches are projected onto 2D computational domains where every sweeping
level is planar in order to increase the robustness of imprinting. Finally, the algorithm time complexity is discussed and examples
are provided to verify the robustness of our proposed algorithm.
Download Full Paper (PDF Format)
Contact author(s) or publisher for availability and copyright information on above referenced article