The efficiency of the application of the heap lists to the algorithm of mesh generation

  • J. Kucwaj Cracow University of Technology, Institute of Computer Science, Department of Physics, Mathematics and Computer Science

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

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.gov.pl/index.php/cames/article/view/129>. Date accessed: 13 nov. 2024.
Citation Formats
Issue
Vol 17 No 2/3/4 (2010)
Section
Articles