Description Usage Arguments Details Value Author(s) References See Also Examples

Computes the Ray Shooting rings of a bivariate data set.

1 |

`pt` |
The data as a matrix, data frame or list. If it is a matrix or data frame, then each row is viewed as one multivariate observation. If it is a list, all components must be numerical vectors of equal length (coordinates of observations). Only 2-dimensional data is acceptable in this version. |

`numofrings` |
Total number of rings expected. |

`clr` |
Boolean for whether colors are used or not. |

`...` |
Reserved for future use. |

Finds out the an arbitrary point among the Ray Shooting median set of given point set. Current uses the brute-force algorithm on all O(n^4) possible points
in the arrangment of all possible lines in complete graph on `pt`

. For each point O(n log n) is used to find out depth so overall complexity of this algorithm is O(n^5 log n).
When approximation parameter is provided then algorithm tries to approximate by finding median of a uniform sample subset of pt of size 1/eps^2*log(1/eps). If this constant is more than the size of original set then eps value is ignored and exact median is calculate on original point set.

Number of rings returned

Nabil Mustafa, Saurabh Ray, and Mudassir Shabbir.

N. Mustafa, S. Ray, and M. Shabbir, Statistical Data Depth of Pointsets in the Plane,*in prep.*.

`rsdepth`

for depth function

1 2 3 4 |

rsdepth documentation built on May 30, 2017, 3:37 a.m.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.