The efficiency of the application of the heap lists to the algorithm of mesh generation
Abstract
The paper presents an analysis of the efficiency of the application of heap lists data structures to the 2D triangular mesh generation algorithms. Such efficiency is especially important for the frontal methods for which the size of the generated mesh is controlled by a prescribed function in the considered domain. In the presented approach two advancing front procedures are presented: first for points insertion and the second for the Delaunay triangulation. If the heap lists are applied to the minimal size of frontal segment selection, a better quality mesh is obtained.
Keywords
tree and lists data structure, frontal methods, Delaunay triangulation, grid generation, mesh adaptation,References
[1] S. Chalasani, D. Thompson. Quality improvements in extruded meshes using topologically adaptive generalized elements. International Journal for Numerical Methods in Engineering, 60: 6, 1139–1159, 2004.[2] J. Kucwaj. Delaunay Triangulation of Surfaces. ZAMM, 76: S.3, 249–250, 1996.
[3] J. Kucwaj. The Algorithm of Adaptation by Using Graded Meshes Generator. Computer Assisted Mechanics and Engineering Sciences, 7: 615–624, 2000.
[4] J. Kucwaj. The Application od the Adaptive Algorithm to the Potential Problems. Annales UMCS Informatica, AI, 2: 37–45, 2004.
[5] J. Kucwaj, Numerical investigations of the convergence of a remeshing algorithm on an example of subsonic flow. Computer Assisted Mechanics and Engineering Sciences, 2–4: 147–160, 2010.
[6] S.H. Lo. Delaunay triangulation of non-convex planar domains. Int. J. Num. Meth. Engng., 28: 2695–2707, 1989.
[7] R. Loehner. Some useful data structures for the generation of unstructured grids. Comm. Appl. Numer. Methods, 4: 123–135, 1988.
[8] R. Loehner. A parallel advancing front grid generation scheme. Int. J. Num. Meth. Engng., 51: 663–678, 2001.
[9] S.J. Owen, S. Saigal. Surface sizing control. Int. J. Num. Meth. Engng., 47: 497–511, 2000.
[10] S.J. Owen, S. Saigal. Formation of pyramid elements for hexahedra to tetrahedra transition. Comp. Meth. Appl. Mech. Engng., 190: 4505–4518, 2001.
[11] S. Pippa, G. Caligiana. GradH-Correction: guaranteed sizing gradation in multi-patch parametric surface meshing. Int. J. Num. Meth. Engng., 62: 495–515, 2005.
[12] A. Szotko, R. Loehner. Three-dimensional parallel unstructured grid generation. Int. J. Num. Meth. Engng., 38: 905–925, 1995.
[13] J.F. Thompson, B.K. Soni, N.P. Weatherwill. Handbook of Grid Generation. CRC Press, Boca Raton, London, New York, Washington, D.C., 1999.
Published
Jan 25, 2017
How to Cite
KUCWAJ, J..
The efficiency of the application of the heap lists to the algorithm of mesh generation.
Computer Assisted Methods in Engineering and Science, [S.l.], v. 17, n. 2/3/4, p. 137–145, jan. 2017.
ISSN 2956-5839.
Available at: <https://cames.ippt.pan.pl/index.php/cames/article/view/129>. Date accessed: 01 june 2025.
Issue
Section
Articles
