Some useful data structures for the generation of unstructured grids
Rainald Löhner · Communications in Applied Numerical Methods · 1988
Abstract Several data structures for the generation of unstructured grids are described. Their usefulness stems from the fact that they enable the necessary search operations to be performed in an optimal way. In particular, we describe heap lists, quad‐ and octrees, and linked lists. Combining these data structures, the important problem of interpolating information between unstructured grids is also solved.