Fully automatic and fast mesh size specification for unstructured mesh generation

A fully automatic surface mesh generation system is presented in this paper. The automation is achieved by an automatic determination of a consistent mesh size distribution, which is based on geometry rasterisation. The user specifies a minimal and maximal allowed mesh size, and a maximal allowed curvature angle for the complete geometry, or, rather, parts of it. Now, these local curvature and local characteristic lengths of the geometry are computed, which determine the local mesh size. These local mesh sizes are stored and smoothed in a Cartesian background mesh. Afterwards, the triangulation is generated by an advancing front triangulator: the local resolution of the surface triangulation is determined by the mesh sizes stored in the Cartesian background mesh. The object-oriented design and implementation is described. The complete system is very fast due to an efficient parallelisation based on MPI for computer systems with distributed memory.

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

[2]  Nigel Weatherill.  Unstructured Grids: Procedures and Applications , 1998 .

[3]  Stephan M. Hitzel,et al.  Complex Configuration Meshing - An Industrial View and Approach , 2003 .

[4]  Les A. Piegl,et al.  Tessellating trimmed surfaces , 1995, Comput. Aided Des..

[5]  Nigel P. Weatherill,et al.  Automatic Unstructured Surface Mesh Generation for Complex Configurations , 2004 .

[6]  Yannis Kallinderis,et al.  Octree-Advancing Front Method for Generation of Unstructured Surface and Volume Meshes , 1997 .

[7]  John Phillips,et al.  Methods in Immunology, 3rd edn, J.S. Garvey, N.E. Cremer, D.H. Sussdorf (Eds.), in: Laboratory Text for Instruction and Research. Addison-Wesley/W. A. Benjamin Inc., Reading, Massachusetts (1977), 545, Price: 96 27.50 (hardbound) , 1978 .

[8]  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 .

[9]  J. Bonet,et al.  An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems , 1991 .

[10]  Nigel P. Weatherill,et al.  Parallel generation of unstructured surface grids , 2005, Engineering with Computers.

[11]  Hanan Samet,et al.  Neighbor finding in images represented by octrees , 1989, Comput. Vis. Graph. Image Process..

[12]  E. Hirschel,et al.  Self-organizing hybrid Cartesian grid/solution system with multigrid , 2002 .

[13]  Bjarne Stroustrup,et al.  C++ : programovací jazyk : The C++ programming language (Orig.) , 1997 .

[14]  大野 義夫,et al.  Computer Graphics : Principles and Practice, 2nd edition, J.D. Foley, A.van Dam, S.K. Feiner, J.F. Hughes, Addison-Wesley, 1990 , 1991 .

[15]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[16]  M. Carter.  Computer graphics: Principles and practice , 1997 .