tri: A triangulation object

Description Arguments Note Author(s) References See Also


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



Number of nodes


x coordinates of the triangulation nodes


y coordinates of the triangulation nodes


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 last neighbors of a boundary node are boundary nodes (the first neighbor of an interior node is arbitrary). In order to distinguish between interior and boundary nodes, the last neighbor of each boundary node is represented by the negative of its index.


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 neighbor).


Set of pointers to adjacency lists. tlend[k] points to the last neighbor of node k for k = 1,...,n. Thus, tlist[tlend[k]]<0 if and only if k is a boundary node.


Pointer to the first empty location in tlist and tlptr (list length plus one).


number of constraints


starting indices of constraints in x and y


call, which generated this object


The elements tlist, tlptr, tlend and tlnew are mainly intended for internal use in the appropriate Fortran routines.


A. Gebhardt


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

tripack documentation built on May 19, 2017, 8:37 p.m.
Search within the tripack package
Search all R packages, documentation and source code

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at

Please suggest features or report bugs in the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.