Surface Mesh Generation based on Imprinting of S-T Edge Patches
One of the most robust and widely used algorithms for all-hexahedral meshes is the sweeping algorithm. However, for multi- sweeping, the most difficult problems are the surface matching and interval assignment for edges on the source and target surfaces. In this paper, a new method to generate surfa...
Saved in:
Published in | Procedia engineering Vol. 82; pp. 325 - 337 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Elsevier Ltd
2014
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | One of the most robust and widely used algorithms for all-hexahedral meshes is the sweeping algorithm. However, for multi- sweeping, the most difficult 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 different 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[19] 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. |
---|---|
ISSN: | 1877-7058 1877-7058 |
DOI: | 10.1016/j.proeng.2014.10.394 |