%0 Journal Article %1 Remacle2012BlossomQuad %A Remacle, J. F. %A Lambrechts, J. %A Seny, B. %A Marchandise, E. %A Johnen, A. %A Geuzaine, C. %D 2012 %J International Journal for Numerical Methods in Engineering %K 05c85-graph-algorithms 65n50-pdes-bvps-mesh-generation-and-refinement %N 9 %P 1102--1119 %R 10.1002/nme.3279 %T Blossom-Quad: A Non-Uniform Quadrilateral Mesh Generator using a Minimum-Cost Perfect-Matching Algorithm %U http://dx.doi.org/10.1002/nme.3279 %V 89 %X 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.

@article{Remacle2012BlossomQuad, abstract = {{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.}}, added-at = {2019-03-01T00:11:50.000+0100}, author = {Remacle, J. F. and Lambrechts, J. and Seny, B. and Marchandise, E. and Johnen, A. and Geuzaine, C.}, biburl = {https://www.bibsonomy.org/bibtex/2f64e64d1eb20d15a873cf6723abddf7d/gdmcbain}, citeulike-article-id = {14388116}, citeulike-attachment-1 = {remacle_12_blossom.pdf; /pdf/user/gdmcbain/article/14388116/1113270/remacle_12_blossom.pdf; 95db2be55c0626c472ea3351118dd16340dd579b}, citeulike-linkout-0 = {http://dx.doi.org/10.1002/nme.3279}, day = 02, doi = {10.1002/nme.3279}, file = {remacle_12_blossom.pdf}, interhash = {a1252c908c2a47daad38511b78174a49}, intrahash = {f64e64d1eb20d15a873cf6723abddf7d}, issn = {00295981}, journal = {International Journal for Numerical Methods in Engineering}, keywords = {05c85-graph-algorithms 65n50-pdes-bvps-mesh-generation-and-refinement}, month = mar, number = 9, pages = {1102--1119}, posted-at = {2017-07-05 01:48:54}, priority = {5}, timestamp = {2019-03-01T00:11:50.000+0100}, title = {{Blossom-Quad: A Non-Uniform Quadrilateral Mesh Generator using a Minimum-Cost Perfect-Matching Algorithm}}, url = {http://dx.doi.org/10.1002/nme.3279}, volume = 89, year = 2012 }