Reference : Blossom-Quad: a non-uniform quadrilateral mesh generator using a minimum cost perfect...
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/113152
Blossom-Quad: a non-uniform quadrilateral mesh generator using a minimum cost perfect matching algorithm
English
Remacle, Jean-François [> >]
Lambrechts, Jonathan [> >]
Seny, Bruno [> >]
Marchandise, Emilie [> >]
Johnen, Amaury mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Applied and Computational Electromagnetics (ACE) >]
Geuzaine, Christophe mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Applied and Computational Electromagnetics (ACE) >]
Feb-2012
International Journal for Numerical Methods in Engineering
Wiley
89
9
1102-1119
Yes (verified by ORBi)
International
0029-5981
1097-0207
Chichester
United Kingdom
[en] quadrilateral meshing ; surface remeshing ; graph theory ; optimization ; perfect matching
[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.
http://hdl.handle.net/2268/113152
10.1002/nme.3279

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
paper-ijnme.pdfAuthor preprint3.88 MBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.