Package: tripack 1.3-9.1

Albrecht Gebhardt

tripack: Triangulation of Irregularly Spaced Data

A constrained two-dimensional Delaunay triangulation package providing both triangulation and generation of voronoi mosaics of irregular spaced data.

Authors:Fortran code by R. J. Renka. R functions by Albrecht Gebhardt <[email protected]>. With contributions from Stephen Eglen <[email protected]>, Sergei Zuyev <[email protected]> and Denis White <[email protected]>

tripack_1.3-9.1.tar.gz
tripack_1.3-9.1.tar.gz(r-4.5-noble)tripack_1.3-9.1.tar.gz(r-4.4-noble)
tripack_1.3-9.1.tgz(r-4.4-emscripten)tripack_1.3-9.1.tgz(r-4.3-emscripten)
tripack.pdf |tripack.html✨
tripack/json (API)

# Install 'tripack' in R:
install.packages('tripack', repos = c('https://cran.r-universe.dev', 'https://cloud.r-project.org'))

Peer review:

Uses libs:
  • fortran– Runtime library for GNU Fortran applications
Datasets:

This package does not link to any Github/Gitlab/R-forge repository. No issue tracker or development information is available.

29 exports 0.91 score 0 dependencies 1 dependents 2 mentions 166 scripts 2.1k downloads

Last updated 4 years agofrom:12b8c3b6a5. Checks:OK: 1 NOTE: 1. Indexed: yes.

TargetResultDate
Doc / VignettesOKAug 24 2024
R-4.5-linux-x86_64NOTEAug 24 2024

Exports:add.constraintcellscirclescircumcircumcircleconvex.hullidentify.triin.convex.hullleftneighbourson.convex.hullouter.convhullplot.triplot.voronoiplot.voronoi.polygonsprint.summary.triprint.summary.voronoiprint.triprint.voronoisummary.trisummary.voronoitri.dellenstri.findtri.meshtrianglesvoronoi.areavoronoi.findrejectsitesvoronoi.mosaicvoronoi.polygons

Dependencies:

Readme and manuals

Help Manual

Help pageTopics
Add a constraint to an triangulaion objectadd.constraint
extract info about voronoi cellscells
plot circlescircles
circtest / sample datacirctest circtest2
Determine the circumcircle of a trianglecircum
Determine the circumcircle of a set of pointscircumcircle
Return the convex hull of a triangulation objectconvex.hull
Identify points in a triangulation plotidentify.tri
Determines if points are in the convex hull of a triangulation objectin.convex.hull
Determines whether given points are left of a directed edge.is.left.of left
List of neighbours from a triangulation objectneighbours
Determines if points are on the convex hull of a triangulation objecton.convex.hull
Version of outer which operates only in a convex hullouter.convhull
Plot a triangulation objectplot.tri
Plot a voronoi objectplot.voronoi
plots an voronoi.polygons objectplot.voronoi.polygons
Print a summary of a triangulation objectprint.summary.tri
Print a summary of a voronoi objectprint.summary.voronoi
Print a triangulation objectprint.tri
Print a voronoi objectprint.voronoi
Return a summary of a triangulation objectsummary.tri
Return a summary of a voronoi objectsummary.voronoi
A triangulation objecttri
Compute the Delaunay segment lengthstri.dellens
Locate a point in a triangulationtri.find
Create a delaunay triangulationtri.mesh
Extract a list of triangles from a triangulation objecttriangles
Internal functionstri.swap tri.swap.lowlevel tri.vordist voronoi.findvertices voronoi.polyarea
tritest / sample datatritest tritest2
Voronoi objectvoronoi
Calculate area of Voronoi polygonsvoronoi.area
Find the Voronoi sites at the border of the region (to be rejected).voronoi.findrejectsites
Create a Voronoi mosaicvoronoi.mosaic
extract polygons from a voronoi mosaicvoronoi.polygons