Learn R Programming

pcds (version 0.1.4)

IncMatCStri: Incidence matrix for Central Similarity Proximity Catch Digraphs (CS-PCDs) - one triangle case

Description

Returns the incidence matrix for the CS-PCD whose vertices are the given 2D numerical data set, dat, in the triangle tri\(=T(v=1,v=2,v=3)\).

CS proximity regions are constructed with respect to triangle tri with expansion parameter \(t>0\) and edge regions are based on the center \(M=(m_1,m_2)\) in Cartesian coordinates or \(M=(\alpha,\beta,\gamma)\) in barycentric coordinates in the interior of the triangle tri; default is \(M=(1,1,1)\) i.e., the center of mass of tri. Loops are allowed, so the diagonal entries are all equal to 1.

See also (ceyhan:Phd-thesis,ceyhan:arc-density-CS,ceyhan:test2014;textualpcds).

Usage

IncMatCStri(dat, tri, t, M = c(1, 1, 1))

Value

Incidence matrix for the CS-PCD with vertices being 2D data set, dat, in the triangle tri with edge regions based on center M

Arguments

dat

A set of 2D points which constitute the vertices of CS-PCD.

tri

Three 2D points, stacked row-wise, each row representing a vertex of the triangle.

t

A positive real number which serves as the expansion parameter in CS proximity region.

M

A 2D point in Cartesian coordinates or a 3D point in barycentric coordinates which serves as a center in the interior of the triangle tri; default is \(M=(1,1,1)\) i.e., the center of mass of tri.

Author

Elvan Ceyhan

References

See Also

IncMatCSMT, IncMatPEtri, and IncMatAStri

Examples

Run this code
A<-c(1,1); B<-c(2,0); C<-c(1.5,2);

Tr<-rbind(A,B,C);
n<-10

set.seed(1)
dat<-runif.tri(n,Tr)$g

M<-as.numeric(runif.tri(1,Tr)$g)  #try also M<-c(1.6,1.0)

IM<-IncMatCStri(dat,Tr,t=1.25,M)
IM
dom.greedy(IM)
dom.exact(IM)
IndUBdom(IM,3)

IncMatCStri(dat,Tr,t=1.5,M)
IncMatCStri(dat,Tr,t=2,M)

t<-2
IncMatCStri(dat,Tr,t,M)

dat.fr<-data.frame(a=dat)
IncMatCStri(dat.fr,Tr,t,M)

dat.fr<-data.frame(a=Tr)
IncMatCStri(dat,dat.fr,t,M)

Run the code above in your browser using DataLab