pcds
Proximity Catch Digraphs and Their Applications
Contains the functions for construction and visualization of various families of the proximity catch digraphs (PCDs), see (Ceyhan (2005) ISBN:978-3-639-19063-2), for computing the graph invariants for testing the patterns of segregation and association against complete spatial randomness (CSR) or uniformity in one, two and three dimensional cases. The package also has tools for generating points from these spatial patterns. The graph invariants used in testing spatial point data are the domination number (Ceyhan (2011) doi:10.1080/03610921003597211) and arc density (Ceyhan et al. (2006) doi:10.1016/j.csda.2005.03.002; Ceyhan et al. (2007) doi:10.1002/cjs.5550350106). The PCD families considered are Arc-Slice PCDs, Proportional-Edge PCDs, and Central Similarity PCDs.
- Version0.1.8
- R versionunknown
- LicenseGPL-2
- Needs compilation?No
- Languageen-US
- Last release12/19/2023
Documentation
- VignetteVS0 - Introduction to pcds
- VignetteVS1.1 - Example: An Artificial 2D Dataset
- VignetteVS1.2 - A Real-Life Example: Swamp Tree Data
- VignetteVS1.3 - Example: An Artificial 1D Dataset
- VignetteVS2.1 - Illustration of PCDs in One Triangle
- VignetteVS2.2 - Illustration of PCDs in One Interval
- VignetteVS2.3 - Illustration of PCDs in One Tetrahedron
- VignetteVS3 - Spatial Point Patterns
- VignetteVS4 - Extrema in Delaunay Cells
- VignetteVS5 - Functions for Euclidean Geometry
- MaterialREADME
Team
Elvan Ceyhan
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports6 packages
- Suggests6 packages
- Reverse Imports2 packages