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.
Version: 0.1.8 Depends: R (≥ 3.5.0) Imports: combinat, interp, gMOIP, plot3D, plotrix, Rdpack (≥ 0.7) Suggests: knitr, scatterplot3d, spatstat.random, rmarkdown, bookdown, spelling Published: 2023-12-19 DOI: 10.32614/CRAN.package.pcds Author: Elvan Ceyhan [aut, cre] Maintainer: Elvan Ceyhan <elvanceyhan at gmail.com> License: GPL-2 NeedsCompilation: no Language: en-US Materials: README CRAN checks: pcds results Documentation: Downloads: Reverse dependencies: Linking:Please use the canonical form https://CRAN.R-project.org/package=pcds to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4