sl.findneighbours | R Documentation |
Given the triangular elements (node triplets) of a regular mesh, find all neighbour nodes for each node.
sl.findneighbours(elem, maxmaxneigh = 12, reverse = TRUE, verbose = FALSE, max.iter = 10)
elem |
an |
maxmaxneigh |
an integer specifying an upper limit for the expected maximum number of neighbours for a node. For a typical (close to orthogonal) triangular mesh, there are 6 neighbours per node on average; the default value |
reverse |
a logical value indicating whether the order of the node neighbours shall be reversed (clockwise/counterclockwise). |
verbose |
a logical value indicating whether print statements shall report on the function progess. |
max.iter |
an integer specifying the maximum number of iterations used to order the neighbours of each node. The default |
It may happen that, despite a sufficiently high value of max.iter
, node neighbours can't be arranged in order and a corresponding warning is printed. In this case the affected nodes might be 'bad' nodes connecting two or more separate regions of the mesh domain, for example two ocean basins (as well as two pieces of land); such a connection should be represented either by multiple nodes, or closed completely. If 'bad' nodes exists, only one contiguous part of the mesh (wrt neighbour nodes and adjacent elements) will be returned for those nodes.
neighbour.nodes |
an |
neighbour.elems |
an |
internal.nodes |
a vector of length |
N.neighbour.nodes |
a vector of length |
all.elements.arranged |
a logical value indicating whether all neighbours and elements have been ordered successfully. |
elems.completed |
|
This function is used by sl.grid.readFESOM
.
Helge Goessling
sl.grid.readFESOM
## To be provided ...
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.