SABER
|
Public Member Functions | |
subroutine | stripack_bdyadd (kk, i1, i2, list, lptr, lend, lnew) |
Add a boundary node to a triangulation. More... | |
Definition at line 50 of file tools_stripack.F90.
subroutine tools_stripack::bdyadd::stripack_bdyadd | ( | integer, intent(in) | kk, |
integer, intent(in) | i1, | ||
integer, intent(in) | i2, | ||
integer, dimension(*), intent(inout) | list, | ||
integer, dimension(*), intent(inout) | lptr, | ||
integer, dimension(*), intent(inout) | lend, | ||
integer, intent(inout) | lnew | ||
) |
Add a boundary node to a triangulation.
[in] | kk | Index of a node to be connected to the sequence of all visible boundary nodes. 1<=KK and KK must not be equal to I1 or I2. |
[in] | i1 | First (rightmost as viewed from KK) boundary node in the triangulation that is visible from node KK (the line segment KK-I1 intersects no arcs. |
[in] | i2 | Last (leftmost) boundary node that is visible from node KK. I1 and I2 may be determined by TRFIND. |
[in,out] | list | Triangulation data structure created by TRMESH. Nodes I1 and I2 must be included in the triangulation. On output, the data structure is updated with the addition of node KK. Node KK is connected to I1, I2, and all boundary nodes in between. |
[in,out] | lptr | cf. list |
[in,out] | lend | cf. list |
[in,out] | lnew | cf. list |
Definition at line 288 of file tools_stripack.F90.