Learn R Programming

tripack (version 1.3-4)

tri: A triangulation object

Description

R object that represents the triangulation of a set of 2D points, generated by tri.mesh or add.constraint.

Arguments

n
Number of nodes
x
x coordinates of the triangulation nodes
y
y coordinates of the triangulation nodes
tlist
Set of nodal indexes which, along with tlptr, tlend, and tlnew, define the triangulation as a set of $n$ adjacency lists -- counterclockwise-ordered sequences of neighboring nodes such that the first and
tlptr
Set of pointers in one-to-one correspondence with the elements of tlist. tlist[tlptr[i]] indexes the node which follows tlist[i] in cyclical counterclockwise order (the first neighbor follows the last
tlend
Set of pointers to adjacency lists. tlend[k] points to the last neighbor of node $k$ for $k = 1,...,n$. Thus, tlist[tlend[k]]
tlnew
Pointer to the first empty location in tlist and tlptr (list length plus one).
nc
number of constraints
lc
starting indices of constraints in x and y
call
call, which generated this object

References

R. J. Renka (1996). Algorithm 751: TRIPACK: a constrained two-dimensional Delaunay triangulation package. ACM Transactions on Mathematical Software. 22, 1-8.

See Also

tri.mesh, print.tri, plot.tri, summary.tri