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.

Back to Top

Document information

Published on 01/01/1988

DOI: 10.1002/cnm.1630040166
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?