Learn R Programming
⚠️There's a newer version (1.3-9.3) of this package.Take me there.

tripack (version 1.3-4)

Triangulation of irregularly spaced data

Description

A constrained two-dimensional Delaunay triangulation package

Copy Link

Version

Install

install.packages('tripack')

Monthly Downloads

2,920

Version

1.3-4

License

file LICENSE

Maintainer

Albrecht Gebhardt

Last Published

October 29th, 2012

Functions in tripack (1.3-4)

cells

extract info about voronoi cells
add.constraint

Add a constraint to an triangulaion object
convex.hull

Return the convex hull of a triangulation object
in.convex.hull

Determines if points are in the convex hull of a triangulation object
print.voronoi

Print a xect
tritest

tritest / sample data
circles

plot circles
triangles

Extract a list of triangles from a triangulation object
summary.voronoi

Return a summary of a objectect
voronoi

Voronoi object
voronoi.area

Calculate area of Voronoi polygons
sgeostat-internal

Internal functions
voronoi.polygons

extract polygons from a voronoi mosaic
plot.voronoi.polygons

plots an voronoi.polygons object
outer.convhull

Version of outer which operates only in a convex hull
on.convex.hull

Determines if points are on the convex hull of a triangulation object
summary.tri

Return a summary of a triangulation object
tri

A triangulation object
identify.tri

Identify points in a triangulation plot
print.tri

Print a triangulation object
print.summary.voronoi

Print a summary of a voronoi object
tri.mesh

Create a delaunay triangulation
plot.voronoi

Plot a xect
voronoi.findrejectsites

Find the Voronoi sites at the border of the region (to be rejected).
tri.dellens

Compute the Delaunay segment lengths
tri.find

Locate a point in a triangulation
plot.tri

Plot a triangulation object
voronoi.mosaic

Create a Voronoi mosaic
print.summary.tri

Print a summary of a triangulation object
neighbours

List of neighbours from a triangulation object