Rdocumentation
powered by
Learn R Programming
⚠️
There's a newer version (1.3-9.3) of this package.
Take me there.
tripack (version 1.3-9)
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.
Copy Link
Link to current version
Version
Version
1.3-9.3
1.3-9.2
1.3-9.1
1.3-9
1.3-8
1.3-7
1.3-6
1.3-5
1.3-4
1.3-3
1.3-2
1.2-11
1.2-10
1.2-9
1.2-8
1.2-6
1.2-5
1.2-4
1.2-3
1.2-2
1.2-0
1.1-2
1.1-1
1.0-3
1.0-2
1.0-1
Install
install.packages('tripack')
Monthly Downloads
2,920
Version
1.3-9
License
ACM | file LICENSE
Maintainer
Fortran code by R J Renka R functions by Albrecht Gebhardt With contributions from Stephen Eglen stephenancedacuk
Last Published
March 6th, 2020
Functions in tripack (1.3-9)
Search all functions
plot.tri
Plot a triangulation object
circum
Determine the circumcircle of a triangle
plot.voronoi
Plot a voronoi object
voronoi
Voronoi object
tri.dellens
Compute the Delaunay segment lengths
tritest
tritest / sample data
tri.find
Locate a point in a triangulation
identify.tri
Identify points in a triangulation plot
convex.hull
Return the convex hull of a triangulation object
tri.mesh
Create a delaunay triangulation
plot.voronoi.polygons
plots an voronoi.polygons object
voronoi.area
Calculate area of Voronoi polygons
tri
A triangulation object
add.constraint
Add a constraint to an triangulaion object
cells
extract info about voronoi cells
print.summary.tri
Print a summary of a triangulation object
summary.voronoi
Return a summary of a voronoi object
circles
plot circles
neighbours
List of neighbours from a triangulation object
print.summary.voronoi
Print a summary of a voronoi object
outer.convhull
Version of outer which operates only in a convex hull
voronoi.findrejectsites
Find the Voronoi sites at the border of the region (to be rejected).
summary.tri
Return a summary of a triangulation object
circumcircle
Determine the circumcircle of a set of points
circtest
circtest / sample data
on.convex.hull
Determines if points are on the convex hull of a triangulation object
voronoi.mosaic
Create a Voronoi mosaic
print.voronoi
Print a voronoi object
tripack-internal
Internal functions
left
Determines whether given points are left of a directed edge.
triangles
Extract a list of triangles from a triangulation object
in.convex.hull
Determines if points are in the convex hull of a triangulation object
voronoi.polygons
extract polygons from a voronoi mosaic
print.tri
Print a triangulation object