CspStandSegmentation0.1.2 package

Comparative Shortest Path Forest Stand Segmentation from LiDAR Data

add_geometry

Add geometric features to a LAS object

add_las_attributes

Add all las_attributes from las@data to the header of a las element

add_voxel_coordinates

Add voxel coordinates to a las file

comparative_shortest_path

helper function for csp_cost_segemntation

csp_cost_segmentation

Comparative Shortest Path with cost weighting tree segmentation

eigen_decomposition

Fast Eigenvalues decomposition for k nearest neighbors using a C++ fun...

fast_unlist_dist

helper function to unlist distances computed by dbscan::frNN

fast_unlist

helper function to unlist IDs generated by dbscan::frNN

fds

Farthest Distance Sampling (Farthest Point Sampling)

find_base_coordinates_geom

Find stem base position using a geometric feature filtering and cluste...

find_base_coordinates_raster

Find stem base position using a density raster approach

forest_inventory_simple

Function to perform a forest inventory based on a segmented las object...

forest_inventory

Function to perform a forest inventory based on a segmented las object...

las_merge

Makes one las-object from multiple las-objects

p_dist

Point distance function

p_mat_dist

Point distance function

plot_inventory

Function to plot the inventory results into a lidR 3d plot of the poin...

point_center_angle

Returns the angle between the center of the circle and a point in degr...

point_circle_distance

Helper function to compute distances from a point to the circle

ransac_circle_fit

RANSAC circle fitting algorithm specially adapted for tree DBH estimat...

suppress_cat

Suppress only the cat() output

voxelize_points_mean_attributes

helper function to voxelize a las element

Functionality for segmenting individual trees from a forest stand scanned with a close-range (e.g., terrestrial or mobile) laser scanner. The complete workflow from a raw point cloud to a complete tabular forest inventory is provided. The package contains several algorithms for detecting tree bases and a graph-based algorithm to attach all remaining points to these tree bases. It builds heavily on the 'lidR' package. A description of the segmentation algorithm can be found in Larysch et al. (2025) <doi:10.1007/s10342-025-01796-z>.

  • Maintainer: Julian Frey
  • License: GPL-3
  • Last published: 2025-10-28