Abstract One of the major difficulties in meshing 3D complex geometries is to deal with non-proper geometrical definitions coming from CAD systems. Typically, CAD systems do not take care of the proper definition of the geometries for the analysis purposes. In addition, the use of standard CAD files (IGES, VDA, …) for the transfer of geometries between different systems introduce some additional difficulties. In this work, a collection of algorithms to repair and/or to improve the geometry definitions are provided. The aim of these algorithms is to make as easy as possible the generation of a mesh over complex geometries given some minimum requirements of quality and correctness. The geometrical model will be considered as composed of a set of NURBS lines and trimmed surfaces. Some examples of application of the algorithms and of the meshes generated from the corrected geometry are also presented in this work.
[1]
Donald Ervin Knuth,et al.
The Art of Computer Programming
,
1968
.
[2]
Josef Hoschek,et al.
Fundamentals of computer aided geometric design
,
1996
.
[3]
Gerald Farin,et al.
Curves and surfaces for cagd
,
1992
.
[4]
P. Lancaster.
Curve and surface fitting
,
1986
.
[5]
P. L. George,et al.
Automatic Mesh Generation: Application to Finite Element Methods
,
1992
.
[6]
Paresh Parikh,et al.
Generation of three-dimensional unstructured grids by the advancing-front method
,
1988
.
[7]
Adi Levin,et al.
Interpolating nets of curves by smooth subdivision surfaces
,
1999,
SIGGRAPH.
[8]
Thomas Ertl,et al.
Computer Graphics - Principles and Practice, 3rd Edition
,
2014
.
[9]
M. Carter.
Computer graphics: Principles and practice
,
1997
.