4.6 Article

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

Journal

Publisher

WILEY
DOI: 10.1002/nme.3279

Keywords

quadrilateral meshing; surface remeshing; graph theory; optimization; perfect matching

Funding

  1. Belgian Walloon Region under WIST [ONELAB 1017086, DOMHEX 1017074]

Ask authors/readers for more resources

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 (C) 2012 John Wiley & Sons, Ltd.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available