{"name":"summary.tri","title":"Return a summary of a triangulation object","pagetitle":"Return a summary of a triangulation object — summary.tri","aliases":"summary.tri","author":"A. Gebhardt","keywords":"spatial","description":"

Returns some information (number of nodes, triangles, arcs, boundary\n nodes and constraints) about object.

","usage":"# S3 method for tri\nsummary(object,...)","arguments":[{"name":"object","description":"

object of class \"tri\"

"},{"name":"...","description":"

additional paramters for summary

"}],"has_args":true,"sections":[],"value":"

An objekt of class \"summary.tri\", to be printed by\n print.summary.tri.

It contains the number of nodes (n), of arcs (na), of\n boundary nodes (nb), of triangles (nt) and constraints\n (nc).

","references":"

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

","seealso":"

tri, print.tri, plot.tri,\n print.summary.tri.

","package":{"package":"tripack","version":"1.3-9"}}

Description

Usage

Arguments

Value

References

See Also