Abstract | ||
---|---|---|
In this paper, we present an efficient method to eliminate the obtuse triangles for high quality 2D mesh generation. Given an initialization (e.g., from Centroidal Voronoi Tessellation—CVT), a limited number of point insertions and removals are performed to eliminate obtuse or small angle triangles. A mesh smoothing and optimization step is then applied. These steps are repeated till a desired good quality mesh is reached. We tested our algorithm on various 2D polygonal domains and verified that our algorithm always converges after inserting a few number of new points, and generates high quality triangulation with no obtuse triangles. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1016/j.camwa.2017.09.041 | Computers & Mathematics with Applications |
Keywords | Field | DocType |
Mesh generation,Triangulation,Obtuse triangles | Mathematical optimization,Polygon,Triangulation (social science),Smoothing,Voronoi diagram,Initialization,Mathematics,Mesh generation,Triangle mesh | Journal |
Volume | Issue | ISSN |
75 | 2 | 0898-1221 |
Citations | PageRank | References |
2 | 0.36 | 15 |
Authors | ||
6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Dawar Khan | 1 | 8 | 4.57 |
Dong-Ming Yan | 2 | 725 | 52.60 |
Wang Yiqun | 3 | 226 | 17.63 |
Kai-Mo Hu | 4 | 43 | 4.89 |
Juntao Ye | 5 | 37 | 7.69 |
Xiaopeng Zhang | 6 | 55 | 18.84 |