|
12th International Meshing Roundtable
September 14-17, 2003
Santa Fe, New Mexico, U.S.A.
Sandia National Laboratories, Albuquerque, NM., U.S.A.
drwhite@sandia.gov,
sjowen@sandia.gov
University of South Florida, Tampa, FL., U.S.A.
saigal@eng.usf.edu
Abstract
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with
unstructured, hexahedral, finite elements. Meshing complexity refers to the relative level of effort required to generate a valid
finite element mesh on a given CAD geometry. A function is proposed to approximate the meshing complexity for single part
CAD models. The function is dependent on a user defined element size as well as on data extracted from the geometry and
topology of the CAD part. Several geometry and topology measures are proposed which both characterize the shape of the CAD
part and detect configurations that complicate mesh generation. Based on a test suite of CAD models the function is
demonstrated to be accurate within a certain range of error. The solution proposed here is intended to provide managers and users
of meshing software a method of predicting the difficulty in meshing a CAD model. This will enable them to make decisions
about model simplification and analysis approaches prior to mesh generation.
Download Full Paper (PDF Format)
Contact author(s) or publisher for availability and copyright information on above referenced article
|