SABER
|
Public Member Functions | |
subroutine | stripack_trfind (nst, p, n, x, y, z, list, lptr, lend, b1, b2, b3, i1, i2, i3) |
Locate a point relative to a triangulation. More... | |
Definition at line 83 of file tools_stripack.F90.
subroutine tools_stripack::trfind::stripack_trfind | ( | integer, intent(in) | nst, |
real(kind_real), dimension(3) | p, | ||
integer, intent(in) | n, | ||
real(kind_real), dimension(n), intent(in) | x, | ||
real(kind_real), dimension(n), intent(in) | y, | ||
real(kind_real), dimension(n), intent(in) | z, | ||
integer, dimension(*), intent(in) | list, | ||
integer, dimension(*), intent(in) | lptr, | ||
integer, dimension(*), intent(in) | lend, | ||
real(kind_real), intent(out) | b1, | ||
real(kind_real), intent(out) | b2, | ||
real(kind_real), intent(out) | b3, | ||
integer, intent(out) | i1, | ||
integer, intent(out) | i2, | ||
integer, intent(out) | i3 | ||
) |
Locate a point relative to a triangulation.
[in] | nst | Index of a node at which TRFIND begins its search. Search time depends on the proximity of this node to P. |
p | X, Y, and Z coordinates (in that order) of the point P to be located. | |
[in] | n | Number of nodes in the triangulation 3<=N. |
[in] | x | X-coordinate of the triangulation nodes (unit vector). |
[in] | y | Y-coordinate of the triangulation nodes (unit vector). |
[in] | z | Z-coordinate of the triangulation nodes (unit vector). |
[in] | list | Triangulation data structure created by TRMESH. |
[in] | lptr | cf. list |
[in] | lend | cf. list |
[out] | b1 | First unnormalized barycentric coordinate of the central projection of P onto the underlying planar triangle if P is in the convex hull of the nodes. These parameters are not altered if I1 = 0. |
[out] | b2 | Second unnormalized barycentric coordinate. |
[out] | b3 | Third unnormalized barycentric coordinate. |
[out] | i1 | First counterclockwise-ordered vertex index of a triangle containing P if P is contained in a triangle. If P is not in the convex hull of the nodes, I1 and I2 are the rightmost and leftmost (boundary) nodes that are visible from P, and I3 = 0. (If all boundary nodes are visible from P, then I1 and I2 coincide.) I1 = I2 = I3 = 0 if P and all of the nodes are coplanar (lie on a common great circle). |
[out] | i2 | Second counterclockwise-ordered vertex index. |
[out] | i3 | Third counterclockwise-ordered vertex index. |
Definition at line 875 of file tools_stripack.F90.