试用软件

Point Cloud Segmentation by Distance

1 次查看（过去 30 天）

显示更早的评论

Thinkboard 2020-4-24

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/520506-point-cloud-segmentation-by-distance

评论： Thinkboard 2020-4-27

采纳的回答： Samatha Aleti

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:

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

采纳的回答

Samatha Aleti 2020-4-27

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/520506-point-cloud-segmentation-by-distance#answer_428598

The following documentation link might help you :

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

1 个评论
显示 -1更早的评论隐藏 -1更早的评论

Thinkboard 2020-4-27

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

请先登录，再进行评论。

更多回答（0 个）

请先登录，再回答此问题。

类别

Image Processing and Computer Vision Computer Vision Toolbox Point Cloud Processing

在 Help Center 和 File Exchange 中查找有关 Point Cloud Processing 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Translated by

试用软件