Triangulation of irregularly spaced data

[Up] [Top]

Documentation for package ‘tripack’ version 1.3-4

Help Pages

add.constraint Add a constraint to an triangulaion object
cells extract info about voronoi cells
circles plot circles
convex.hull Return the convex hull of a triangulation object
identify.tri Identify points in a triangulation plot
in.convex.hull Determines if points are in the convex hull of a triangulation object
neighbours List of neighbours from a triangulation object
on.convex.hull Determines if points are on the convex hull of a triangulation object
outer.convhull Version of outer which operates only in a convex hull
plot.tri Plot a triangulation object
plot.voronoi Plot a xect
plot.voronoi.polygons plots an voronoi.polygons object
print.summary.tri Print a summary of a triangulation object
print.summary.voronoi Print a summary of a voronoi object
print.tri Print a triangulation object
print.voronoi Print a xect
summary.tri Return a summary of a triangulation object
summary.voronoi Return a summary of a objectect
tri A triangulation object
tri.dellens Compute the Delaunay segment lengths
tri.find Locate a point in a triangulation
tri.mesh Create a delaunay triangulation
tri.vordist Internal functions
triangles Extract a list of triangles from a triangulation object
tritest tritest / sample data
tritest2 tritest / sample data
voronoi Voronoi object
voronoi.area Calculate area of Voronoi polygons
voronoi.findrejectsites Find the Voronoi sites at the border of the region (to be rejected).
voronoi.findvertices Internal functions
voronoi.mosaic Create a Voronoi mosaic
voronoi.polyarea Internal functions
voronoi.polygons extract polygons from a voronoi mosaic