Construction of a triangular gridfor regions bounded by closed simple curves
At present, the triangulation method is widely used in many computational problems, for example, using the finite element method (FEM). The use of triangular grids in the solution of various boundary value problems is also due to the fact that derivatives of any order can be easily approximated on them with sufficient accuracy. In this case, the calculation process, as a rule, can be unified and organized so that the dependence on the grid is minimal [5]. Therefore, the claimed task is to develop algorithms for triangulation of areas that do not require much time for implementation and do not spend a large amount of computer resources. In the work [6] we have presented one such algorithm, based on the process of grinding triangulation triangles. In this paper we describe another approach to constructing a triangular grid for arbitrary planar domains and give an estimate of the minimum sine of the angle of triangles under certain geometric conditions.