×

zbMATH — the first resource for mathematics

Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities. (English) Zbl 1176.74181
Summary: Gmsh is an open-source 3-D finite element grid generator with a build-in CAD engine and post-processor. Its design goal is to provide a fast, light and user-friendly meshing tool with parametric input and advanced visualization capabilities. This paper presents the overall philosophy, the main design choices and some of the original algorithms implemented in Gmsh.

MSC:
74S05 Finite element methods applied to problems in solid mechanics
76M10 Finite element methods applied to problems in fluid mechanics
65M50 Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs
65N50 Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Dular P, Geuzaine C. GetDP: a general environment for the treatment of discrete problems, 1997. Available from: http://www.geuz.org/getdp/.
[2] SDRC. I-DEAS Master Series, SDRC, 1993.
[3] Muuss M. BRL-CAD, Army Research Laboratory, 1984.
[4] Shewchuk, Applied Computational Geometry: Towards Geometric Engineering pp 203– (1996)
[5] Vavasis S. QMG: mesh generation and related software, 1995. Available from: http://www.cs.cornell.edu/home/vavasis/qmg-home.html.
[6] Joe, GEOMPACK-a software package for the generation of meshes using geometric algorithms, Advances in Engineering Software 13 pp 325– (1991) · Zbl 0753.65090
[7] Ollivier-Gooch CF. GRUMMP-generation and refinement of unstructured, mixed-element meshes in parallel, 1998. Available from: http://tetra.mech.ubc.ca/GRUMMP/.
[8] Ortega F. GMV: the general mesh viewer, 1996. Available from: http://www-xdiv.lanl.gov/XCM/gmv/GMVHome.html.
[9] Schöberl, Netgen, an advancing front 2d/3d-mesh generator based on abstract rules, Computing and Visualization in Science 1 pp 41– (1997) · Zbl 0883.68130
[10] Dhondt G, Wittig K. Calculix: a free software three-dimensional structural finite element program, 1998. Available from: http://www.calculix.de.
[11] Segal M, Akeley K. The OpenGL graphics system: a specification. Technical Report, Silicon Graphics Computer Systems, 1992.
[12] Heller, Motif Programming Manual 6A (1994)
[13] Spitzak B. FLTK, the fast light tool kit, 2008. Available from: http://www.fltk.org.
[14] GNU. The GNU general public license, 1988. Available from: http://www.gnu.org/licenses/gpl.html.
[15] Geuzaine C, Remacle J-F. Gmsh: a finite element mesh generator with built-in pre- and post-processing facilities, 1996. Available from: http://www.geuz.org/gmsh/. · Zbl 1176.74181
[16] Stroustrup, The C++ Programming Language (1997)
[17] Dongarra, A set of level 3 basic linear algebra subprograms, ACM Transactions on Mathematical Software (TOMS) 16 (1) pp 1– (1990) · Zbl 0900.65115
[18] Anderson, LAPACK Users’ Guide (1999) · Zbl 0934.65030
[19] Strauss, IRIS Inventor, a 3D graphics toolkit, ACM SIGPLAN Notices 28 (10) pp 192– (1993)
[20] Schroeder, The Visualization Toolkit (1998)
[21] Vinoski, CORBA: integrating diverse applications within distributed heterogeneous environments, IEEE Communications Magazine 35 (2) pp 46– (1997)
[22] Levine, Lex & Yacc (1992)
[23] Shewchuk JR. Robust adaptive floating-point geometric predicates. Annual Symposium on Computational Geometry, Proceedings of the Twelfth Annual Symposium on Computational Geometry, Philadelphia, PA, U.S.A., 1996; 141-150. ISBN: 0-89791-804-5. DOI: http://doi.acm.org/10.1145/237218.237337.
[24] Debian. Debian linux, 2008. Available from: http://www.debian.org.
[25] Paul B. The Mesa 3D graphics library, 1995. Available from: http://www.mesa3d.org/.
[26] Open CASCADE S.A.S. Open cascade, 2008. http://www.opencascade.org.
[27] Siemens PLM Software. Parasolid, Available from: 2008. http://www.parasolid.com.
[28] Si H. Tetgen a quality tetrahedral mesh generator and three-dimensional Delaunay triangulator, 2004. Available from: http://tetgen.berlios.de/.
[29] Vaughan, GNU Autoconf, Automake and Libtool (2000)
[30] Geuzaine C. GL2PS: an OpenGL to PostScript printing library, 2000. Available from: http://www.geuz.org/gl2ps/.
[31] Dassault Systèmes. Catia, 2008. Available from: http://www.3ds.com.
[32] Haimes R. CAPRI: computational analysis programming interface (a solid modeling based infra-structure for engineering analysis and design). Technical Report, Massachusetts Institute of Technology, 2000.
[33] Beall, A general topology-based mesh data structure, International Journal for Numerical Methods in Engineering 40 (9) pp 1573– (1997)
[34] Hecht F. Bamg: bidimensional anisotropic mesh generator, 2006. Available from: http://www.freefem.org/ff++.
[35] Laug P, Borouchaki H. Blsurf-mesh generator for composite parametric surfaces-user’s manual. Technical Report, INRIA, France, 1999.
[36] George, Mesh Generation (2000)
[37] Pebay, Analysis of triangle quality measures, Mathematics of Computation 72 (244) pp 1817– (2003)
[38] Liu, Relationship between tetrahedron shape measures, BIT Numerical Mathematics 34 (2) pp 268– (1994) · Zbl 0806.65104
[39] Piegl, The Nurbs Book (1997)
[40] Frey PJ. About surface remeshing. Ninth International Meshing Roundtable, 2000.
[41] Bechet, Generation of a finite element mesh from stereolithography (STL) files, Computer-Aided Design 34 (1) pp 1– (2002)
[42] Yerry, Automatic three-dimensional mesh generation by the modified-octree technique, International Journal for Numerical Methods in Engineering 20 (11) pp 1965– (1984) · Zbl 0547.65077
[43] George, Delaunay Triangulation and Meshing: Application to Finite Elements (1998) · Zbl 0908.65143
[44] Cuilliere, An adaptive method for the automatic triangulation of 3d parametric surfaces, Computer-Aided Design 2 pp 139– (1998)
[45] Shimada K, Yamada A, Itoh T. Anisotropic triangular meshing of parametric surfaces via close packing of ellipsoidal bubbles. Sixth International Meshing Roundtable, 1997; 375-390.
[46] Lo, Generation of anisotropic mesh by ellipse packing over an unbounded domain, Engineering with Computers 20 (4) pp 372– (2005)
[47] Rebay, Efficient unstructured mesh generation by means of Delaunay triangulation and Bowyer-Watson algorithm, Journal of Computational Physics 106 pp 25– (1993) · Zbl 0777.65064
[48] Li X. Mesh modification procedure for general 3-D non-manifold domains. Ph.D. Thesis, Renselear Polytechnic Institute, 2003.
[49] Li X, Remacle J-F, Chevaugeon N, Shephard MS. Anisotropic mesh gradation control. Thirteenth International Meshing Roundtable, 2004.
[50] Remacle, Anisotropic adaptive simulation of transient flows using discontinuous Galerkin methods, International Journal for Numerical Methods in Engineering 62 (7) pp 899– (2005) · Zbl 1078.76042
[51] Dwyer RA. A simple divide-and-conquer algorithm for computing Delaunay triangulations in o(n log log n) expected time. Proceedings of the Second Annual Symposium on Computational Geometry, 1986; 276-284.
[52] Weatherill, The integrity of geometrical boundaries in the two-dimensional Delaunay triangulation, Communications in Applied Numerical Methods 6 (2) pp 101– (1990) · Zbl 0696.65083
[53] Freitag, Tetrahedral mesh improvement using face swapping and smoothing, International Journal for Numerical Methods in Engineering 40 (21) pp 3979– (1998) · Zbl 0897.65075
[54] George, Automatic mesh generator with specified boundary, Computer Methods in Applied Mechanics and Engineering 92 (3) pp 269– (1991) · Zbl 0756.65133
[55] Watson, Computing the n-dimensional Delaunay tessellation with application to vorono polytopes, The Computer Journal 24 (2) pp 167– (1981)
[56] Lambrechts, Multiscale mesh generation on the sphere, Ocean Dynamics 58 pp 461– (2008)
[57] Berger KA, Kubicek B. Magnetic field of a 30 kV/400 V-substation. Private communication, Arsenal Research, Austria, 2008.
[58] Remacle, Efficient visualization of high-order finite elements, International Journal for Numerical Methods in Engineering 69 (4) pp 750– (2007) · Zbl 1194.76226
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.