Browse > Article
http://dx.doi.org/10.5139/JKSAS.2004.32.9.041

An Efficient Triangular Mesh Generation Algorithm using Domain-wise Hash Structure  

Kim, Tae-Joo (인하대학교 항공우주공학과 대학원)
Cho, Jin-Yeon (인하대학교 항공우주공학과)
Publication Information
Journal of the Korean Society for Aeronautical & Space Sciences / v.32, no.9, 2004 , pp. 41-48 More about this Journal
Abstract
In this work, a domain-wise hash structure is developed for efficient data handling, and by using the developed domain-wise hash structure, an automatic triangular mesh generation algorithm is proposed. To generate the optimal nodal points and triangles efficiently, the advancing layer method and Delaunay triangulation method are utilized. To investigate the performance of the proposed algorithm, benchmarking tests are carried out for various models including convex, concave and complicated shapes through the developed object oriented C++ mesh generation code.
Keywords
Domain-wise hash structure; Delaunay triangulation; Advancing layer method; Automatic triangular mesh generation;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Bowyer, A., "Computing Dirichlet Tessellations," Computer Journal, Vol. 2, No. 24, 1981, pp. 162-166.
2 Berman, A. M., Data structures via C++, Oxford University Press, 1997.
3 Garimella, R. V., "Mesh data structure selection for mesh generation and FEA applications," Int. J. Numer. Meth. Eng., Vol. 55, No. 4, 2002, pp.451-478.   DOI   ScienceOn
4 Pirzadeh S., "Thee-Dimensional Unstructured Viscous Grids by the Advancing Layer Method," AIAA Journal, Vol. 34, No. 1 1996, pp. 43-49.   DOI
5 김태주, 조진연, "해쉬구조 기반의 효율적 삼각형 요소망 생성기법 개발," 한국항공우주공학회 춘계학술대회 논문집, 2003, pp. 169-172.
6 Shewchuk, J. R., "Lecture Notes on Delaunay Mesh Generation," Department of Electrical Engineering and Computer Science University of California at Berkeley, 1999.
7 Field, D. A., "Laplacian Smoothing and Delaunay Triangulation," Communications in Applied Numerical Methods, Vol. 4, 1988, pp. 709-712.   DOI   ScienceOn
8 Lohner, R., "Automatic unstructured grid generators," Finite Elements in Analysis and Design, Vol. 25, Nos. 1-2, 1997, pp.111-134.   DOI   ScienceOn
9 Berg, M. D., Dreveld, M. V., Overmars, M., Schwarzkopf, O., Computational Geometry Algorithms and Applications 2nd Edition, Springer Press, 1999.
10 Watson, D. F., "Computing the n-dimensional Delaunay Tessellation with Application to Voronoi Polytopes," Computer Journal, Vol. 2, No. 24, 1981, pp. 167-172.
11 Lee, C. K., Hobbs, R. E., "Automatic adaptive finite element mesh generation over arbitrary two-dimensional domain using advancing front technique," Computers & Structures, Vol. 71, No. 1, 1999, pp. 9-34.   DOI   ScienceOn