A structured tri‐tree search method for generation of optimal unstructured finite element grids in two and three dimensions

Abstract

A new method for generating finite element grids in two and three dimensions is developed. The method is based on a new search tree structure. The search tree is built upon triangles in two dimensions and tetrahedra in three dimensions. The density of elements can be varied throughout the computational domain. Efficient search algorithms for finding points in space and for finding the boundary of the domain have been developed. The speed of the grid algorithm will permit adaptive gridding during computation. The grid algorithm is generally applicable to both hydrodynamic as well as aerodynamic finite element computations. The technique has been used with success for gridding the North Sea‐Skagerrak area.