Nothing
hespdiv: Hierarchical Spatial Data Subdivision into Topologically Contiguous Units
Implementation of the HespDiv framework for hierarchical spatial subdivision of geographical occurrence data. The main function hespdiv() performs iterative spatially constrained subdivision of a study area to identify topologically contiguous clusters in geographic space using user-defined or preset subdivision methods. Additional functions provide tools for analysing subdivision results, visualizing hierarchical spatial structures, and evaluating robustness through sensitivity analyses and statistical testing. Some examples use the optional HDData data package, which is available from GitHub at Liudas-Dau/hespdiv_data. The methodology is described in Daumantas and Spiridonov (2024) <doi:10.1111/pala.12702>.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Liudas Daumantas [aut, cre], Andrej Spiridonov [aut], Joseph O'Rourke [ctb, cph] (Author and copyright holder of point-in-polygon code in src/pip.c), Min Xu [ctb] (Contributor to point-in-polygon code in src/pip.c) |
| Maintainer | Liudas Daumantas <liudas.daumantas@chgf.vu.lt> |
| License | GPL-3 |
| Version | 1.2.10 |
| URL | https://doi.org/10.1111/pala.12702 https://github.com/Liudas-Dau/hespdiv https://github.com/Liudas-Dau/hespdiv_data |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the hespdiv package in your browser
Any scripts or data that you put into this service are public.
