Blossom-Quad: A non-uniform quadrilateral mesh generator using a minimum-cost perfect-matching algorithm

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...

Full description

Saved in:
Bibliographic Details
Published in:International journal for numerical methods in engineering Vol. 89; no. 9; pp. 1102 - 1119
Main Authors: Remacle, J.-F., Lambrechts, J., Seny, B., Marchandise, E., Johnen, A.,  Geuzainet, C.
Format: Journal Article
Language:English
Published: Chichester, UK John Wiley & Sons, Ltd 02.03.2012
Wiley
Subjects:
ISSN:0029-5981, 1097-0207, 1097-0207
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ArticleID:NME3279
ark:/67375/WNG-F3LHX478-S
istex:93ACBB92919A6402D2FB12D503C7BF5563334868
scopus-id:2-s2.0-84857138334
ISSN:0029-5981
1097-0207
1097-0207
DOI:10.1002/nme.3279