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.
Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.
Published on 01/01/1988
DOI: 10.1002/cnm.1630040166Licence: CC BY-NC-SA license
Views 0Recommendations 0
Are you one of the authors of this document?