×

Blossom-Quad

swMATH ID: 41267
Software Authors: J.F. Remacle, J. Lambrechts, B. Seny, E. Marchandise, A. Johnen, C.Geuzainet
Description: Blossom-Quad: a non-uniform quadrilateral mesh generator using a minimum cost perfect matching algorithm. A new indirect way of producing all-quad meshes is presented. The method takes advantage of a well-known algorithm of the graph theory, namely the Blossom algorithm, that computes the minimum-cost perfect matching in a graph in polynomial time. The new Blossom-Quad algorithm is compared with standard indirect procedures. Meshes produced by the new approach are better both in terms of element shape and in terms of size field efficiency
Homepage: https://gmsh.info/doc/preprints/gmsh_quad_preprint.pdf
Related Software: Gmsh; QuadCover; RACCOON; MOOSE; CGAL; GitHub; Q-Morph; BL2D-V2; bamg; deal.ii; p4est; meshio; GEPSO; UQLab; EMOD2D; MT2DInvMatlab; UELcode; ReebHanTun; libQEx; QEx
Cited in: 25 Documents

Citations by Year