Efficient Spatial Thinning of Species Occurrences
Calculate Spatial Coverage (Convex Hull Area)
Compute Nearest Neighbor Distances
Compute Neighbors Using Brute-Force
Compute Neighbors Using kd-Tree
Compute Neighbors Using Local kd-Trees
Perform Distance-Based Thinning
Estimate Maximum Neighbors for kd-Tree Thinning
GeoThinned Object Constructor and Methods
Perform Grid-Based Thinning of Spatial Points
Check for Longitude/Latitude Coordinates
Convert Geographic Coordinates to Cartesian Coordinates
Thinning Algorithm for Spatial Data
Precision Thinning of Spatial Points
Select Target Number of Points for Spatial Thinning
Spatial Thinning of Points
Provides efficient geospatial thinning algorithms to reduce the density of coordinate data while maintaining spatial relationships. Implements K-D Tree and brute-force distance-based thinning, as well as grid-based and precision-based thinning methods. For more information on the methods, see Elseberg et al. (2012) <https://hdl.handle.net/10446/86202>.
Useful links