Edge fields

Figure 182: Node per edge relationship

During the mesh refinement no middle nodes are considered. Consequently, edges only contain two nodes. They are numbered according to their storage in field iedg(1..3,*) (Figure 182). In this field entry iedg(1,i) contains the first node of edge i and iedg(2,i) contains the second node, such that iedg(1,i) $ <$ iedg(2,i). For a node j ipoed(j) points to an edge in field iedg for which j is the smallest node number. If there is more than one such edge iedg(3,i) points to the next entry in iedg containing an edge for which j is again the smallest node number. If no more such edge exists the value of iedg(3,..)=0. This is a construct similar to field ieln. An actual free entry in field iedg is pointed to by ifreeed, and for any free line k iedg(3,k) points to a next free line.

Fields containing a similar number of lines as iedg are d(*) containing the length of the edges, n(*) containing the number of new nodes to be inserted on the edge for the mesh refinement (can only take the value 0 or 1 in each iteration depending on whether a node is to be inserted), r(*) containing the bias for the node insertion (if any) and iedgmid(*) containing the number of the midnode on the edge. The latter field is only introduced at the end of the mesh refinement (in projectnodes.f) and only if quadratic tetrahedral elements are requested. Finally, there is the field iexternedg(*) which takes the value:

Figure 183: Element per edge relationship

The last fields ipoeled(i) and ieled(2,*) point to the elements to which edge i belongs in the same way the element per node relationship is stored in ipoeln(*) and ieln(2,*), Figure 183.