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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal for numerical methods in engineering Jg. 89; H. 9; S. 1102 - 1119
Hauptverfasser: Remacle, J.-F., Lambrechts, J., Seny, B., Marchandise, E., Johnen, A.,  Geuzainet, C.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Chichester, UK John Wiley & Sons, Ltd 02.03.2012
Wiley
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science
Computer science; control theory; systems
Engineering, computing & technology
Exact sciences and technology
Graph theory
Information retrieval. Graph
Ingénierie, informatique & technologie
Mathematics
Methods of scientific computing (including symbolic computation, algebraic computation)
Numerical analysis. Scientific computation
optimization
perfect matching
quadrilateral meshing
Sciences and techniques of general use
Sciences informatiques
surface remeshing
Theoretical computing
Costs
Quadrilateral finite element
Refinement method
Graph theory
quadrilateral meshing
surface remeshing
Automatic mesh generation
Optimization
Polynomial time
Finite element method
Efficiency
perfect matching
Mesh generation
Graph matching
ISSN:0029-5981, 1097-0207, 1097-0207
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie: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