plotCSregs {pcds} | R Documentation |
The plot of the Central Similarity (CS) Proximity Regions for a 2D data set - multiple triangle case
Description
Plots the points in and outside of the Delaunay triangles based on Yp
points which partition
the convex hull of Yp
points and also plots the CS proximity regions
for Xp
points and the Delaunay triangles based on Yp
points.
CS proximity regions are constructed with respect to the Delaunay triangles with the expansion parameter t>0
.
Edge regions in each triangle is based on the center M=(\alpha,\beta,\gamma)
in barycentric coordinates in the interior of each Delaunay triangle
(default for M=(1,1,1)
which is the center of mass of the triangle).
See (Ceyhan (2005); Ceyhan et al. (2007); Ceyhan (2014)) more on the CS proximity regions. Also see (Okabe et al. (2000); Ceyhan (2010); Sinclair (2016)) for more on Delaunay triangulation and the corresponding algorithm.
Usage
plotCSregs(
Xp,
Yp,
t,
M = c(1, 1, 1),
asp = NA,
main = NULL,
xlab = NULL,
ylab = NULL,
xlim = NULL,
ylim = NULL,
...
)
Arguments
Xp |
A set of 2D points for which CS proximity regions are constructed. |
Yp |
A set of 2D points which constitute the vertices of the Delaunay triangles. |
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 |
asp |
A |
main |
An overall title for the plot (default= |
xlab , ylab |
Titles for the |
xlim , ylim |
Two |
... |
Additional |
Value
Plot of the Xp
points, Delaunay triangles based on Yp
and also the CS proximity regions
for Xp
points inside the convex hull of Yp
points
Author(s)
Elvan Ceyhan
References
Ceyhan E (2005).
An Investigation of Proximity Catch Digraphs in Delaunay Tessellations, also available as technical monograph titled Proximity Catch Digraphs: Auxiliary Tools, Properties, and Applications.
Ph.D. thesis, The Johns Hopkins University, Baltimore, MD, 21218.
Ceyhan E (2010).
“Extension of One-Dimensional Proximity Regions to Higher Dimensions.”
Computational Geometry: Theory and Applications, 43(9), 721-748.
Ceyhan E (2014).
“Comparison of Relative Density of Two Random Geometric Digraph Families in Testing Spatial Clustering.”
TEST, 23(1), 100-134.
Ceyhan E, Priebe CE, Marchette DJ (2007).
“A new family of random graphs for testing spatial segregation.”
Canadian Journal of Statistics, 35(1), 27-50.
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
plotCSregs.tri
, plotASregs
and plotPEregs
Examples
#nx is number of X points (target) and ny is number of Y points (nontarget)
nx<-15; ny<-5; #try also nx<-40; ny<-10 or nx<-1000; ny<-10;
set.seed(1)
Xp<-cbind(runif(nx,0,1),runif(nx,0,1))
Yp<-cbind(runif(ny,0,.25),runif(ny,0,.25))+cbind(c(0,0,0.5,1,1),c(0,1,.5,0,1))
#try also Yp<-cbind(runif(ny,0,1),runif(ny,0,1))
M<-c(1,1,1) #try also M<-c(1,2,3)
tau<-1.5 #try also tau<-2
plotCSregs(Xp,Yp,tau,M,xlab="",ylab="")