A simple quality triangulation algorithm for complex geometries

被引:5
作者
Zhang, Yaoxin [1 ]
Jia, Yafei [1 ]
Chan, H. C. [1 ]
Wang, Sam S. Y. [1 ]
机构
[1] Univ Mississippi, Natl Ctr Computat Hydrosci & Engn, University, MS 38677 USA
关键词
triangulation; Delaunay; refinement; MESH GENERATION; VORONOI DIAGRAMS;
D O I
10.1002/fld.2323
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper presents a simple algorithm for quality triangulation in domains with complex geometries. Based on the fact that the equilateral triangles (regular meshes) are ideal for numerical computations in computational fluids dynamics (CFD) analysis, the proposed algorithm starts with an initial equilateral triangle mesh covering the whole domain. Nodes close to the boundary edges satisfy the so-called non-encroaching criterion, the distance from any inserted node to any boundary vertices and the midpoints of any boundary edge is greater than a given characteristic length. Both nearly uniform and non-uniform triangle meshes can be generated using a mesh size reduction technique. Local refinement is achieved by using transition layers. More regular meshes can be generated in the interior of the domain and all angles of the triangle mesh produced by this algorithm are proven to be bounded in a reasonable range (19.5-141 degrees). Copyright (C) 2010 John Wiley & Sons, Ltd.
引用
收藏
页码:1447 / 1464
页数:18
相关论文
共 50 条
  • [1] A simple unstructured tetrahedral mesh generation algorithm for complex geometries
    Karamete, BK
    Akay, HU
    Tokdemir, T
    Ger, M
    MATHEMATICAL AND COMPUTER MODELLING, 1996, 24 (10) : 97 - 112
  • [2] Unstructured grid generation and a simple triangulation algorithm for arbitrary 2-D geometries using object oriented programming
    Karamete, BK
    Tokdemir, T
    Ger, M
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1997, 40 (02) : 251 - 268
  • [3] A Smoothing Algorithm for Contour Lines by Means of Triangulation
    Irigoyen, Jesus
    Martin, Maria T.
    Rodriguez, Jaime
    CARTOGRAPHIC JOURNAL, 2009, 46 (03) : 262 - 267
  • [4] Surface triangulation over intersecting geometries
    Shostko, AA
    Löhner, R
    Sandberg, WC
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1999, 44 (09) : 1359 - 1376
  • [5] Lepp terminal centroid method for quality triangulation: A study on a new algorithm
    Rivara, Maria-Cecilia
    Calderon, Carlo
    ADVANCES IN GEOMETRIC MODELING AND PROCESSING, 2008, 4975 : 215 - 230
  • [6] Effective, computational stability parallel algorithm for construction of a pseudo-triangulation of a simple polygon
    Dvortsov, VI
    Ivanovsky, SA
    Proceedings of the Second IASTED International Multi-Conference on Automation, Control, and Information Technology - Software Engineering, 2005, : 108 - 110
  • [7] Delaunay triangulation by a technical insertion point applied for complexes geometries
    Zebbiche, Toufik
    Hamdi, Nasreddine
    JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING, 2011, 11 (03) : 143 - 158
  • [8] An algorithm for automatic Delaunay triangulation of arbitrary planar domains
    Du, CJ
    ADVANCES IN ENGINEERING SOFTWARE, 1996, 27 (1-2) : 21 - 26
  • [9] Complex conforming Delaunay triangulation
    XianHai Meng
    JiGang Li
    Qin Yang
    Qiang Cai
    QiMing Chen
    Science China Information Sciences, 2010, 53 : 1130 - 1140
  • [10] Complex conforming Delaunay triangulation
    Meng XianHai
    Li JiGang
    Yang Qin
    Cai Qiang
    Chen QiMing
    SCIENCE CHINA-INFORMATION SCIENCES, 2010, 53 (06) : 1130 - 1140