Port variant | std |
Summary | Delaunay Triangulation and Dirichlet Tessellation |
BROKEN | |
Package version | 2.0.4 |
Homepage | No known homepage |
Keywords | cran |
Maintainer | CRAN Automaton |
License | Not yet specified |
Other variants | There are no other variants. |
Ravenports | Buildsheet | History |
Ravensource | Port Directory | History |
Last modified | 09 AUG 2024, 21:24:17 UTC |
Port created | 15 APR 2020, 18:11:42 UTC |
single | deldir: Delaunay Triangulation and Dirichlet (Voronoi) Tessellation Calculates the Delaunay triangulation and the Dirichlet or Voronoi tessellation (with respect to the entire plane) of a planar point set. Plots triangulations and tessellations in various ways. Clips tessellations to sub-windows. Calculates perimeters of tessellations. Summarises information about the tiles of the tessellation. Calculates the centroidal Voronoi (Dirichlet) tessellation using Lloyd's algorithm. |
Build (only) |
gmake:primary:std R:primary:std icu:dev:std |
Runtime (only) |
R:primary:std R:nls:std |
main | mirror://CRAN/src/contrib https://loki.dragonflybsd.org/cranfiles/ |
R-spdep:std | Spatial Dependence: Weighting Schemes, Statistics |