pcds (version 0.1.2)

Kfr2vTbVRCC: The k furthest points from vertices in each \(CC\)-vertex region in a basic triangle

Description

An object of class "Extrema". Returns the k furthest data points among the data set, Dt, in each \(CC\)-vertex region from the vertex in the basic triangle \(T_b=T(A=(0,0),B=(1,0),C=(c_1,c_2))\).

Any given triangle can be mapped to the basic triangle by a combination of rigid body motions (i.e., translation, rotation and reflection) and scaling, preserving uniformity of the points in the original triangle. Hence basic triangle is useful for simulation studies under the uniformity hypothesis.

ch.all.intri is for checking whether all data points are inside \(T_b\) (default is FALSE). In the extrema, \(ext\), in the output, the first k entries are the k furthest points from vertex 1, second k entries are k furthest points are from vertex 2, and last k entries are the k furthest points from vertex 3 If data size does not allow, NA's are inserted for some or all of the k furthest points for each vertex.

Usage

Kfr2vTbVRCC(Dt, c1, c2, k, ch.all.intri = FALSE)

Arguments

Dt

A set of 2D points representing the set of data points.

c1, c2

Positive real numbers which constitute the vertex of the basic triangle. adjacent to the shorter edges; \(c_1\) must be in \([0,1/2]\), \(c_2>0\) and \((1-c_1)^2+c_2^2 \le 1\)

k

A positive integer. k furthest data points in each \(CC\)-vertex region are to be found if exists, else NA are provided for (some of) the k furthest points.

ch.all.intri

A logical argument for checking whether all data points are inside \(T_b\) (default is FALSE).

Value

A list with the elements

txt1

Vertex labels are \(A=1\), \(B=2\), and \(C=3\) (corresponds to row number in Extremum Points).

txt2

A shorter description of the distances as "Distances of k furthest points in the vertex regions to Vertices".

type

Type of the extrema points

desc

A short description of the extrema points

mtitle

The "main" title for the plot of the extrema

ext

The extrema points, here, k furthest points from vertices in each vertex region.

X

The input data, Dt, can be a matrix or data frame

num.points

The number of data points, i.e., size of Dt

supp

Support of the data points, here, it is \(T_b\).

cent

The center point used for construction of edge regions.

ncent

Name of the center, cent, it is circumcenter "CC" for this function.

regions

Vertex regions inside the triangle, \(T_b\), provided as a list.

region.names

Names of the vertex regions as "vr=1", "vr=2", and "vr=3"

region.centers

Centers of mass of the vertex regions inside \(T_b\).

dist2ref

Distances from k furthest points in each vertex region to the corresponding vertex (each row representing a vertex).

See Also

fr2vTbVRCC, fr2vVRCC, fr2eTeER, and Kfr2vVRCC

Examples

# NOT RUN {
c1<-.4; c2<-.6;
A<-c(0,0); B<-c(1,0); C<-c(c1,c2);
Tb<-rbind(A,B,C)
n<-20
k<-3

set.seed(1)
dat<-runif.bastri(n,c1,c2)$g

Ext<-Kfr2vTbVRCC(dat,c1,c2,k)
Ext
summary(Ext)
plot(Ext)

Kfr2vTbVRCC(dat[1:k,],c1,c2,k)
Kfr2vTbVRCC(dat[1,],c1,c2,k)

kf2v<-Kfr2vTbVRCC(dat,c1,c2,k)

CC<-circ.cent.bastri(c1,c2)  #the circumcenter
D1<-(B+C)/2; D2<-(A+C)/2; D3<-(A+B)/2;
Ds<-rbind(D1,D2,D3)

Xlim<-range(Tb[,1],dat[,1])
Ylim<-range(Tb[,2],dat[,2])
xd<-Xlim[2]-Xlim[1]
yd<-Ylim[2]-Ylim[1]

plot(A,pch=".",asp=1,xlab="",ylab="",xlim=Xlim+xd*c(-.05,.05),ylim=Ylim+yd*c(-.05,.05))
polygon(Tb)
L<-matrix(rep(CC,3),ncol=2,byrow=TRUE); R<-Ds
segments(L[,1], L[,2], R[,1], R[,2], lty=2)
points(dat)
points(kf2v$ext,pch=4,col=2)

txt<-rbind(Tb,CC,Ds)
xc<-txt[,1]+c(-.03,.03,.02,.07,.06,-.05,.01)
yc<-txt[,2]+c(.02,.02,.03,-.02,.02,.03,-.04)
txt.str<-c("A","B","C","CC","D1","D2","D3")
text(xc,yc,txt.str)

Kfr2vTbVRCC(dat,c1,c2,k)

Kfr2vTbVRCC(c(.4,.2),c1,c2,k)

dat.fr<-data.frame(a=dat)
Kfr2vTbVRCC(dat.fr,c1,c2,k)

dat2<-rbind(dat,c(.2,.4))
Kfr2vTbVRCC(dat2,c1,c2,k)

# }