Automatic Generation of CFD-Ready Surface Triangulations from CAD Geometry

This paper presents an approach for the generation of closed manifold surface triangulations from CAD geometry. CAD parts and assemblies are used in their native format, without translation, and a part’s native geometry engine is accessed through a modeler-independent application programming interface (API). In seeking a robust and fully automated procedure, the algorithm is based on a new physical space manifold triangulation technique specially developed to avoid robustness issues associated with poorly conditioned mappings. In addition, this approach avoids the usual ambiguities associated with floating-point predicate evaluation on constructed coordinate geometry in a mapped space. The technique is incremental, so that each new site improves the triangulation by some well defined quality measure. Sites are inserted using a variety of priority queues to ensure that new insertions will address the worst triangles first. As a result of this strategy, the algorithm will return its “best” mesh for a given (prespecified) number of sites. Alternatively, the algorithm may be allowed to terminate naturally after achieving a prespecified measure of mesh quality. The resulting triangulations are “CFD-ready” in that: (I) edges match the underlying part model to within a specified tolerance; (2) triangles on disjoint surfaces in close proximity have matching length-scales. (3) The algorithm produces a triangulation such that no angle is less than a given angle bound, (w, or greater than n ~CL. This result also sets bounds on the maximum vertex degree, triangle aspect-ratio and maximum stretching rate for the triangulation. In addition to the output triangulations for a variety of CAD parts, the‘discussion presents related theoretical results which assert the existence of such an angle bound, and demonstrate that maximum bounds of between 25’ and 30’ may be achieved in practice.

[1]  Jonathan Richard Shewchuk,et al.  Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates , 1997, Discret. Comput. Geom..

[2]  L. Paul Chew,et al.  Guaranteed-Quality Triangular Meshes , 1989 .

[3]  Dimitri J. Mavriplis,et al.  An advancing front Delaunay triangulation algorithm designed for robustness , 1993 .

[4]  Rainald Loehner,et al.  Matching semi-structured and unstructured grids for Navier-Stokes calculations , 1993 .

[5]  Michael J. Aftosmis,et al.  Robust and efficient Cartesian mesh generation for component-based geometry , 1997 .

[6]  David Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[7]  Shahyar Pirzadeh,et al.  Unstructured Viscous Grid Generation by Advancing-Layers Method , 1993 .

[8]  David Eppstein,et al.  Provably Good Mesh Generation , 1994, J. Comput. Syst. Sci..

[9]  Yannis Kallinderis,et al.  Hybrid grids for viscous flows around complex 3-D geometries including multiple bodies , 1995 .

[10]  N. Weatherill,et al.  Unstructured grid generation using iterative point insertion and local reconnection , 1995 .

[11]  S. Sutharshana,et al.  Automatic three-dimensional mesh generation by the modified-octree technique: Yerry M A and Shepard, M SInt. J. Numer. Methods Eng. Vol 20 (1984) pp 1965–1990 , 1985 .

[12]  David L. Marcum,et al.  Generation of unstructured grids for viscous flow applications , 1995 .

[13]  Dimitri J. Mavriplis,et al.  Adaptive mesh generation for viscous flows using delaunay triangulation , 1990 .

[14]  Raymond Cosner Issues in aerospace application of CFD analysis , 1994 .

[15]  Mark S. Shephard,et al.  Automatic three‐dimensional mesh generation by the finite octree technique , 1984 .

[16]  A. Przekwas,et al.  Adaptive Cartesian/adaptive prism (ACAP) grid generation for complex geometries , 1997 .

[17]  Robert Haimes A Geometry Based Infra-Structure for Computational Analysis and Design , 1997 .

[18]  L. Paul Chew,et al.  Guaranteed-quality mesh generation for curved surfaces , 1993, SCG '93.

[19]  S. Pirzadeh Structured background grids for generation of unstructured grids by advancing front method , 1991 .

[20]  Jim Ruppert,et al.  A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.

[21]  Joan Wellington,et al.  INITIAL GRAPHICS EXCHANGE SPECIFICATION (IGES), VERSION 3.0 , 1986 .

[22]  Timothy J. Barth,et al.  Numerical aspects of computing high Reynolds number flows on unstructured meshes , 1991 .

[23]  Timothy Barth,et al.  Steiner triangulation for isotropic and stretched elements , 1995 .

[24]  M. Berger,et al.  Robust and efficient Cartesian mesh generation for component-based geometry , 1998 .

[25]  Michael J. Wozny,et al.  Automatic CAD-model Repair: Shell-Closure , 1992 .

[26]  Michael J. Aftosmis,et al.  Aspects (and aspect ratios) of cartesian mesh methods , 1998 .