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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal for numerical methods in engineering Ročník 89; číslo 9; s. 1102 - 1119
Hlavní autoři:	Remacle, J.-F., Lambrechts, J., Seny, B., Marchandise, E., Johnen, A., Geuzainet, C.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Chichester, UK John Wiley & Sons, Ltd 02.03.2012 Wiley
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!