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 tar...

Full description

Saved in:
Bibliographic Details
Published inEngineering with computers Vol. 31; no. 3; pp. 439 - 452
Main Authors Cai, Shengyong, Tautges, Timothy J.
Format Journal Article
LanguageEnglish
Published London Springer London 01.07.2015
Springer Nature B.V
Subjects
Algorithms
CAE) and Design
Cages
Calculus of Variations and Optimal Control; Optimization
Classical Mechanics
Computer Science
Computer-Aided Engineering (CAD
Control
Deformation
Math. Applications in Chemistry
Mathematical and Computational Engineering
Mesh generation
Original Article
Smoothing
Sweeping
Systems Theory
Harmonic
Sweeping
Hexahedral
Mesh generation
One-to-one
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0177-0667
1435-5663
DOI:10.1007/s00366-014-0374-x