Resumo

DU TOIT, CG.. Setting up the cell neighbour array and the list of external faces for a finite volume mesh. R&D j. (Matieland, Online) [online]. 1998, vol.14, pp.1-7. ISSN 2309-8988.

Three different schemes to sort the cell faces in a finite volume mesh into external and internal faces and to set up the cell neighbour array are compared. In each case a list of all the cell faces is systematically compiled whilst the faces of each cell are processed. As a face is added to the list, it is compared with the faces already in the list to determine whether it matches any of the faces. The faces can therefore also be sorted into external and internal faces at the same time. In the first algorithm each face in the list is checked until a face is found which matches the new face or the end of the list is reached. In the second algorithm a linked list of all the unmatched faces is maintained and the new face is therefore only compared with those in the linked list until a matching face is found or the end of the list is reached. In the third scheme the smallest nodal number associated with the new face is identified. Linked lists are compiled of all the unmatched faces which share the same smallest nodal number. When searching for a matching face, it is therefore only necessary to compare the new face with those in the same linked list.

        · texto em Inglês     · Inglês ( pdf )