Adaptive Sweeping Techniques

Proceedings, 14th International Meshing Roundtable, Springer-Verlag, pp.417-432, September 11-14 2005

MESHING
RESEARCH
CORNER

14th International Meshing Roundtable
San Diego, CA, USA
September 11-14, 2005

Michael A. Scott, Matthew N. Earp, Steven E. Benzley
seb@byu.edu

Michael B. Stephenson
M. B. Stephenson & Associates, Provo, UT U.S.A.
mbsteph@sandia.gov

Abstract
This paper presents an adaptive approach to sweeping one-to-one and many-to-one geometry. The automatic decomposition of many-to-one geometry into one-to-one "blocks" and the selection of an appropriate node projection scheme are vital steps in the efficient generation of high-quality swept meshes. This paper identifies two node projection schemes which are used in tandem to robustly sweep each block of a one-to-one geometry. Methods are also presented for the characterization of one-to-one geometry and the automatic assignment of the most appropriate node projection scheme. These capabilities allow the sweeper to adapt to the requirements of the sweep block being processed. The identification of the two node projection schemes was made after an extensive analysis of existing schemes was completed. One of the node projection schemes implemented in this work, BoundaryError, was selected from traditional node placement algorithms. The second node projection scheme, SmartAffine, is an extension of simple affine transformations and is capable of efficiently sweeping geometry with source and/or target curvature while approximating the speed of a simple transform. These two schemes, when used in this adaptive setting, optimize mesh quality and the speed that swept meshes can be generated while minimizing required user interaction.

Download Full Paper (PDF Format)