Surface Mesh Generation for Dirty Geometries by Shrink Wrapping using Cartesian Grid Approach

A Cartesian shrink wrapping technique has been investigated in this study to construct triangular surface meshes for three-dimensional dirty geometries. The geometries dealt in this paper are defined by faceted representation with dirtiness such as nonconforming edges, gaps and overlaps. The objective of the proposed technique is to deliver a way constructing triangular surface meshes for upstream solutions in design processes without extensive labors for healing dirtiness in complicated dirty geometries. A Cartesian grid is overlaid onto the dirty geometries and its cells are adaptively refined until target resolution is achieved while recording intersections with geometric facets in cells. An initial watertight shell called the wrapper surface is constructed by selectively extracting the boundary sides of intersected cells. The wrapper surface is improved by a subsequence of operations such as projecting nodes onto geometry, adjusting nodes on the geometry and editing local triangular faces to achieve better approximation. The meshes generated using the presented technique may not be geometrically accurate but their quality is good enough to quickly deliver upstream fluid analysis solutions with significantly reduced engineering time for problems of extreme complexity such as the full underhood fluid/thermal analysis for automobiles. Mesh generation experiments have been carried out for complicated geometries and results from some applications are presented in this paper.

[1]  Hans-Peter Seidel,et al.  A Shrink Wrapping Approach to Remeshing Polygonal Surfaces , 1999, Comput. Graph. Forum.

[2]  Hao Zhang,et al.  Mesh smoothing with shape or Feature preservation , 2002 .

[3]  Charles W. Steele.  Automatic and Adaptive Mesh Generation , 1997 .

[4]  Joe Walsh,et al.  Accessing CAD Geometry for Mesh Generation , 2003, IMR.

[5]  L. Herrmann.  Laplacian-Isoparametric Grid Generation Scheme , 1976 .

[6]  Alla Sheffer,et al.  Virtual Topology Operators for Meshing , 2000, Int. J. Comput. Geom. Appl..

[7]  Heinrich Müller,et al.  Improved Laplacian Smoothing of Noisy Surface Meshes , 1999, Comput. Graph. Forum.

[8]  John R. Chawner,et al.  Fast Surface Meshing on Imperfect CAD Models , 2000, IMR.

[9]  Zhi J. Wang,et al.  An adaptive Cartesian grid generation method for ‘Dirty’ geometry , 2002 .

[10]  Marsha Berger,et al.  Adaptive Urban Dispersion Integrated Model , 2005 .

[11]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[12]  Jin Zhu,et al.  Background Overlay Grid Size Functions , 2002, IMR.

[13]  Leif Kobbelt,et al.  Automatic restoration of polygon models , 2005, TOGS.

[14]  Gabriel Taubin,et al.  Curve and surface smoothing without shrinkage , 1995, Proceedings of IEEE International Conference on Computer Vision.

[15]  Rolf Bünten,et al.  Automatic generation of hexahedral finite element meshes , 1995, Comput. Aided Geom. Des..

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