#GMSH BLOSSOM GENERATOR#

Summary ： about 2D Grid algorithm, The best quality is the wavefront method, The fastest is the triangulation algorithm, The best stability is adaptive algorithm. Gmsh is built around four modules: geometry, mesh, solver and post-processing. Its design goal is to provide a fast, light and user-friendly meshing tool with parametric input and advanced visualization capabilities.

#GMSH BLOSSOM GENERATOR#

Third 、 Triangles are merged into full quadrilateral (Full_Blosson + Wavefront method )Ībout dividing triangles ( tetrahedron ) Grid algorithm test ： The method takes advantage of a wellknown algorithm of the graph theory, namely the Blossom algorithm, that computes the minimum-cost perfect matching in a. Gmsh is a three-dimensional finite element mesh generator with a build-in CAD engine and post-processor. Second 、 Triangles are merged into full quadrilateral (Full_Blosson + Delaunay)

The test results are as follows ：įirst of all 、 Triangles are merged into full quadrilateral (Full_Blosson + Adaptive algorithm ) This test is based on personal development CAD/CAE platform ,OSG As its display engine. This article only needs to do some tests, It doesn't involve coding, Based on some code in the previous article, Recompile Gmsh with opencascade, Checked this time BLOSSON Options, The purpose is to make all triangles merge into quadrangles, At the same time gmsh Some tests have been done on the internal algorithm of, Intuitively reflect the advantages and disadvantages of each algorithm. 0 has been configured for Linu圆4 - Build options: 64Bit ALGLIBsystem Annsystem Bamg Blasgeneric Blossom Cairo DIntegration Dlopen DomHex Fltk GMP.

Gmsh blossom