SABER
|
Public Member Functions | |
subroutine | stripack_addnod (mpl, nst, k, x, y, z, list, lptr, lend, lnew) |
Add a node to a triangulation. More... | |
Definition at line 44 of file tools_stripack.F90.
subroutine tools_stripack::addnod::stripack_addnod | ( | type(mpl_type), intent(inout) | mpl, |
integer, intent(in) | nst, | ||
integer, intent(in) | k, | ||
real(kind_real), dimension(k), intent(in) | x, | ||
real(kind_real), dimension(k), intent(in) | y, | ||
real(kind_real), dimension(k), intent(in) | z, | ||
integer, dimension(*), intent(inout) | list, | ||
integer, dimension(*), intent(inout) | lptr, | ||
integer, dimension(k), intent(inout) | lend, | ||
integer, intent(inout) | lnew | ||
) |
Add a node to a triangulation.
[in,out] | mpl | MPI data |
[in] | nst | Index of a node at which TRFIND, begins its search.Search time depends on the proximity of this node to K. If NST<1, the search is begun at node K-1. |
[in] | k | Nodal index (index for X, Y, Z, and LEND) of the new node to be added. 4<=K. |
[in] | x | X-coordinates of the nodes |
[in] | y | Y-coordinates of the nodes |
[in] | z | Z-coordinates of the nodes |
[in,out] | list | On input, the data structure associated with the triangulation of nodes 1 to K-1. On output, the data has been updated to include node K. The array lengths are assumed to be large enough to add node K. Refer to TRMESH. |
[in,out] | lptr | cf. list |
[in,out] | lend | cf. list |
[in,out] | lnew | cf. list |
Definition at line 99 of file tools_stripack.F90.