Point Cloud Segmentation by Distance

Hi everyone,

I am a beginner to MATLAB and I am doing a project which required a regular segmentation of 3D pointcloud. After some research, "Kd-Tree" may be one of the solution, is there anyway to implement "Kd-Tree" in MATLAB or there's another alternative for segmenting 3D point cloud into a regular cube? Thank you!

Something i imagine like this:

Answer 1

[Samatha Aleti]

The following documentation link might help you :

https://www.mathworks.com/help/vision/ref/pointcloud.findnearestneighbors.html

[Thinkboard]

It will result in circular searching radius. Any method to search in rectangular?