Premium
Blossom‐Quad: A non‐uniform quadrilateral mesh generator using a minimum‐cost perfect‐matching algorithm
Author(s) -
Remacle J.F.,
Lambrechts J.,
Seny B.,
Marchandise E.,
Johnen A.,
Geuzainet C.
Publication year - 2012
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.3279
Subject(s) - quadrilateral , polygon mesh , algorithm , matching (statistics) , mathematics , graph , computer science , finite element method , combinatorics , geometry , engineering , structural engineering , statistics
SUMMARY 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. Copyright © 2012 John Wiley & Sons, Ltd.