Article (Scientific journals)
Blossom-Quad: a non-uniform quadrilateral mesh generator using a minimum cost perfect matching algorithm
Remacle, Jean-François; Lambrechts, Jonathan; Seny, Bruno et al.
2012In International Journal for Numerical Methods in Engineering, 89 (9), p. 1102-1119
Peer Reviewed verified by ORBi
 

Files


Full Text
paper-ijnme.pdf
Author preprint (3.97 MB)
Download

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
quadrilateral meshing; surface remeshing; graph theory; optimization; perfect matching
Abstract :
[en] 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.
Disciplines :
Computer science
Author, co-author :
Remacle, Jean-François
Lambrechts, Jonathan
Seny, Bruno
Marchandise, Emilie
Johnen, Amaury ;  Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Applied and Computational Electromagnetics (ACE)
Geuzaine, Christophe  ;  Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Applied and Computational Electromagnetics (ACE)
Language :
English
Title :
Blossom-Quad: a non-uniform quadrilateral mesh generator using a minimum cost perfect matching algorithm
Publication date :
February 2012
Journal title :
International Journal for Numerical Methods in Engineering
ISSN :
0029-5981
eISSN :
1097-0207
Publisher :
Wiley, Chichester, United Kingdom
Volume :
89
Issue :
9
Pages :
1102-1119
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBi :
since 29 February 2012

Statistics


Number of views
241 (16 by ULiège)
Number of downloads
583 (4 by ULiège)

Scopus citations®
 
122
Scopus citations®
without self-citations
110
OpenCitations
 
93

Bibliography


Similar publications



Contact ORBi