PCL Euclidean Distance Clustering Source Code Analysis

I spent some time looking at the relevant algorithms and took a simple note.

The specific implementation method of the Euclidean algorithm is roughly as follows:

Determine if a point is inside a polygon (C++ code)

I tested the code and made a few small changes to improve the efficiency.

Determine whether it is inside the polygon based on the number of intersection points between points and the edges of the polygon

PCL Principal Component Analysis (PCA) in 3D Point Cloud C++ code

This C++ code perform Principal Component Analysis (PCA) on a 3D point cloud and project pointcloud to the space spanned by the eigenvectors

PCL computing point cloud AABB and OBB bounding box ( C++ code)

method 1: use getMinMax3D Compute way…

C ++ splits a string containing multiple values and multiple strings with commas, and then converts the value in the split result into a floating value. If it is a string, keep the string and save it to the list…

C ++ splits a string with a comma or other symbol, and then converts the result of each split into a floating or int value and saves it to a list

The code initializes inputto “1.1, 2.2, 3.3, 4.4, 5.5”, then splits the string with…

Tree Volume Calculation Method Based on 3D Laser Scanning Point Cloud use Matlab code

Aiming at the problem that the shape of the canopy is irregular and the volume of the canopy is difficult tomeasure and calculate, a method based on 3D laser scanning is proposed point…

Open3D (C++) Improved K-means Clustering Algorithm

Lidar Drivable Area Detection

Recently, I looked at the detection code of the drivable area of DJI , and did a little reading and code…

PCL K4PCS algorithm realizes point cloud registration with c++ code

algorithm steps: