num.delaunay.tri {pcds}

Number of Delaunay triangles based on a 2D data set

Description

Returns the number of Delaunay triangles based on the 2D set of points Yp. See (Okabe et al. (2000); Sinclair (2016)) for more on Delaunay triangulation and the corresponding algorithm.

Usage

num.delaunay.tri(Yp)

Arguments

Yp

A set of 2D points which constitute the vertices of Delaunay triangles.

Value

Number of Delaunay triangles based on Yp points.

Author(s)

Elvan Ceyhan

References

Okabe A, Boots B, Sugihara K, Chiu SN (2000). Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Wiley, New York.

Sinclair D (2016). “S-hull: a fast radial sweep-hull routine for Delaunay triangulation.” 1604.01428.

See Also

plotDelaunay.tri

Examples

ny<-10

set.seed(1)
Yp<-cbind(runif(ny,0,1),runif(ny,0,1))

num.delaunay.tri(Yp)