num.arcsAS {pcds} | R Documentation |
Number of arcs of Arc Slice Proximity Catch Digraphs (AS-PCDs) and related quantities of the induced subdigraphs for points in the Delaunay triangles - multiple triangle case
Description
An object of class "NumArcs"
.
Returns the number of arcs and
various other quantities related to the Delaunay triangles
for Arc Slice Proximity Catch Digraph (AS-PCD)
whose vertices are the data points in Xp
in the multiple triangle case (with triangulation based on Yp
points).
AS proximity regions are defined with respect to the
Delaunay triangles based on Yp
points
and vertex regions in each triangle
are based on the center M="CC"
for circumcenter of each Delaunay triangle
or M=(\alpha,\beta,\gamma)
in barycentric coordinates in the
interior of each Delaunay triangle;
default is M="CC"
i.e., circumcenter of each triangle.
Convex hull of Yp
is partitioned
by the Delaunay triangles based on Yp
points
(i.e., multiple triangles are the set of these Delaunay triangles
whose union constitutes the
convex hull of Yp
points).
For the number of arcs, loops are not allowed so arcs are only possible
for points inside the convex hull of Yp
points.
See (Ceyhan (2005, 2010)) for more on AS-PCDs. Also see (Okabe et al. (2000); Ceyhan (2010); Sinclair (2016)) for more on Delaunay triangulation and the corresponding algorithm.
Usage
num.arcsAS(Xp, Yp, M = "CC")
Arguments
Xp |
A set of 2D points which constitute the vertices of the AS-PCD. |
Yp |
A set of 2D points which constitute the vertices of the Delaunay triangles. |
M |
The center of the triangle. |
Value
A list
with the elements
desc |
A short description of the output: number of arcs and related quantities for the induced subdigraphs in the Delaunay triangles |
num.arcs |
Total number of arcs in all triangles, i.e., the number of arcs for the entire AS-PCD |
num.in.conv.hull |
Number of |
num.in.tris |
The vector of number of |
weight.vec |
The |
tri.num.arcs |
The |
del.tri.ind |
A matrix of indices of Delaunay triangles based on |
data.tri.ind |
A |
tess.points |
Tessellation points, i.e., points on which the tessellation of
the study region is performed,
here, tessellation is the Delaunay triangulation based on |
vertices |
Vertices of the digraph, |
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 (2012).
“An investigation of new graph invariants related to the domination number of random proximity catch digraphs.”
Methodology and Computing in Applied Probability, 14(2), 299-334.
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
num.arcsAStri
, num.arcsPE
, and num.arcsCS
Examples
nx<-15; ny<-5; #try also nx<-40; ny<-10 or nx<-1000; ny<-10;
set.seed(1)
Xp<-cbind(runif(nx),runif(nx))
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<-"CC" #try also M<-c(1,1,1)
Narcs = num.arcsAS(Xp,Yp,M)
Narcs
summary(Narcs)
plot(Narcs)