Nothing
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.
Getting started
Package overview
README.md
VS0 - Introduction to pcds"
VS1.1 - Example: An Artificial 2D Dataset"
VS1.2 - A Real-Life Example: Swamp Tree Data"
VS1.3 - Example: An Artificial 1D Dataset"
VS2.1 - Illustration of PCDs in One Triangle"
VS2.2 - Illustration of PCDs in One Interval"
VS2.3 - Illustration of PCDs in One Tetrahedron"
VS3 - Spatial Point Patterns"
VS4 - Extrema in Delaunay Cells"
VS5 - Functions for Euclidean Geometry"
Browse package contents
Package details |
|
|---|---|
| Author | Elvan Ceyhan [aut, cre] |
| Maintainer | Elvan Ceyhan <elvanceyhan@gmail.com> |
| License | GPL-2 |
| Version | 0.1.8 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the pcds package in your browser
Any scripts or data that you put into this service are public.
