A dynamic data structure for bidimensional and tridimensional Delaunay mesh generation

Abstract

In this work it is presented the implementation of an algorithm for triangular and tetrahedral Delaunay mesh generation, by the implementation of a set data structure and generic methods that allow selecting dynamically the size of each of these structures, producing classes and methods of order 2, as well as of order 3, according to the dimension of the studied problem. The key idea of this algorithm is to provide 2-dimensional and 3-dimensional mesh generation, without needing two algorithms, or still, of complex data structures, and thus, eliminating code redundancy. The presented methodology was developed with the aid of the containers of Standard Template Library (STL), which supports the necessary tools for the algorithm development.