A frontal Delaunay quad mesh generator using the L ∞ norm
SUMMARYIn a recent work, a new indirect method to generate all‐quad meshes has been developed. It takes advantage of a well‐known algorithm of the graph theory, namely the Blossom algorithm, which computes in polynomial time the minimum cost perfect matching in a graph. In this paper, we describe a...
Saved in:
Published in: | International journal for numerical methods in engineering Vol. 94; no. 5; pp. 494 - 512 |
---|---|
Main Authors: | , , , , , , |
Format: | Journal Article Web Resource |
Language: | English |
Published: |
Chichester
Blackwell Publishing Ltd
04-05-2013
Wiley Wiley Subscription Services, Inc |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | SUMMARYIn a recent work, a new indirect method to generate all‐quad meshes has been developed. It takes advantage of a well‐known algorithm of the graph theory, namely the Blossom algorithm, which computes in polynomial time the minimum cost perfect matching in a graph. In this paper, we describe a method that allows to build triangular meshes that are better suited for recombination into quadrangles. This is performed by using the infinity norm to compute distances in the meshing process. The alignment of the elements in the frontal Delaunay procedure is controlled by a cross field defined on the domain. Meshes constructed this way have their points aligned with the cross‐field directions, and their triangles are almost right everywhere. Then, recombination with the Blossom‐based approach yields quadrilateral meshes of excellent quality. Copyright © 2013 John Wiley & Sons, Ltd. |
---|---|
Bibliography: | ArticleID:NME4458 istex:CA100ECFEBF4EA6427D1E647C645B3661CA37C95 ark:/67375/WNG-P8JKHJ0H-4 Belgian Walloon Region - No. ONELAB 1017086; No. DOMHEX 1017074 scopus-id:2-s2.0-84876799991 |
ISSN: | 0029-5981 1097-0207 1097-0207 |
DOI: | 10.1002/nme.4458 |