|
Internal deldir functions.
● Data Source:
CranContrib
● Keywords: internal
● Alias: [.tile.list, [.triang.list, acw, binsrt, dumpts, get.cnrind, getCol, mid.in, mnnd, tilePerim0
●
0 images
|
|
Lists the indices of the vertices of each Delaunay triangle in the triangulation of a planar point set. The indices are listed (in increasing numeric order) as the rows of an n x 3 matrix where n is the number of Delaunay triangles in the triangulation.
● Data Source:
CranContrib
● Keywords: spatial
● Alias: triMat
●
0 images
|
|
Create the “dividing chain” of the Dirchlet tesselation of a given set of points having distinguishing (categorical) “weights”. This dividing chain consists of those edges of Dirichlet tiles which separate points having different values of the given weights.
● Data Source:
CranContrib
● Keywords: spatial
● Alias: divchain.default
●
0 images
|
|
From an object of class “deldir” produces a list of the Delaunay triangles in the triangulation of a set of points in the plane.
● Data Source:
CranContrib
● Keywords: spatial
● Alias: triang.list
●
0 images
|
|
This is a method for plot.
● Data Source:
CranContrib
● Keywords: hplot
● Alias: plot.deldir
●
0 images
|
|
Create the “dividing chain” of a Dirchlet tesselation. The tessellation must have been created from a set of points having associated categorical “weights”. The dividing chain consists of those edges of Dirichlet tiles which separate points having different values of the given weights.
● Data Source:
CranContrib
● Keywords: spatial
● Alias: divchain.deldir
●
0 images
|
Given a list of Dirichlet tiles, as produced by tile.list(), produces a data frame consisting of the centroids of those tiles.
● Data Source:
CranContrib
● Keywords: spatial
● Alias: tile.centroids
●
0 images
|
|
Calculates the perimeters of all of the Dirichlet (Voronoi) tiles in a tessellation of a set of planar points. Also calculates the sum and the mean of these perimeters.
● Data Source:
CranContrib
● Keywords: spatial
● Alias: tilePerim
●
0 images
|
|
Find which points among a given set are duplicates of others.
● Data Source:
CranContrib
● Keywords: utilities
● Alias: duplicatedxy
●
0 images
|
This function computes the Delaunay triangulation (and hence the Dirichlet or Voronoi tesselation) of a planar point set according to the second (iterative) algorithm of Lee and Schacter — see REFERENCES. The triangulation is made to be with respect to the whole plane by suspending it from so-called ideal points (-Inf,-Inf), (Inf,-Inf) (Inf,Inf), and (-Inf,Inf). The triangulation is also enclosed in a finite rectangular window. A set of dummy points may be added, in various ways, to the set of data points being triangulated.
● Data Source:
CranContrib
● Keywords: spatial
● Alias: deldir
●
0 images
|
providing 
.