Returns the number of arcs of Central Similarity Proximity Catch Digraphs (CS-PCDs) whose vertices are the
given 2D numerical data set, Xp. It also provides number of vertices (i.e., number of data points inside the triangle)
and indices of the data points that reside in the triangle.
CS proximity region \(N_{CS}(x,t)\) is defined with respect to the standard
equilateral triangle \(T_e=T(v=1,v=2,v=3)=T((0,0),(1,0),(1/2,\sqrt{3}/2))\) 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 \(T_e\);
default is \(M=(1,1,1)\) i.e., the center of mass of \(T_e\).
For the number of arcs, loops are not allowed so
arcs are only possible for points inside \(T_e\) for this function.
See also (ceyhan:Phd-thesis,ceyhan:arc-density-CS,ceyhan:test2014;textualpcds).