Learn R Programming

tripack (version 1.3-9.2)

Triangulation of Irregularly Spaced Data

Description

A constrained two-dimensional Delaunay triangulation package providing both triangulation and generation of voronoi mosaics of irregular spaced data. Please note that most of the functions are now also covered in package interp, which is a re-implementation from scratch under a free license based on a different triangulation algorithm.

Copy Link

Version

Install

install.packages('tripack')

Monthly Downloads

2,985

Version

1.3-9.2

License

ACM | file LICENSE

Maintainer

Fortran code by R J Renka R functions by Albrecht Gebhardt With contributions from Stephen Eglen stephenancedacuk

Last Published

October 21st, 2024

Functions in tripack (1.3-9.2)

circum

Determine the circumcircle of a triangle
print.summary.tri

Print a summary of a triangulation object
circles

plot circles
circtest

circtest / sample data
outer.convhull

Version of outer which operates only in a convex hull
plot.tri

Plot a triangulation object
voronoi.area

Calculate area of Voronoi polygons
print.tri

Print a triangulation object
cells

extract info about voronoi cells
plot.voronoi

Plot a voronoi object
circumcircle

Determine the circumcircle of a set of points
tritest

tritest / sample data
print.voronoi

Print a voronoi object
plot.voronoi.polygons

plots an voronoi.polygons object
voronoi.findrejectsites

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

List of neighbours from a triangulation object
voronoi

Voronoi object
tri.find

Locate a point in a triangulation
on.convex.hull

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

Create a delaunay triangulation
triangles

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

Return a summary of a triangulation object
summary.voronoi

Return a summary of a voronoi object
tripack-internal

Internal functions
print.summary.voronoi

Print a summary of a voronoi object
tri

A triangulation object
tri.dellens

Compute the Delaunay segment lengths
voronoi.mosaic

Create a Voronoi mosaic
voronoi.polygons

extract polygons from a voronoi mosaic
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
left

Determines whether given points are left of a directed edge.
add.constraint

Add a constraint to an triangulaion object
identify.tri

Identify points in a triangulation plot