Octree implementation for point cloud [closed]

asked 2020-03-11 11:01:04 -0500

ee18mtech11025@iith.ac.in gravatar image

I want to implement the octree structure for point cloud data. There is an octree library given by PCL, but there is not much flexibility if that. It will be helpful if anyone guides me to the best algorithm available for building an Octree. Till now I am not getting any good resource that explains the detailed algorithm or pseudo code for that.

edit retag flag offensive reopen merge delete

Closed for the following reason PCL Question: The PCL community prefers to answer questions at http://www.pcl-users.org/ by mgruhler
close date 2020-03-12 04:14:14.031021



but there is not much flexibility if that

I think you need to defend that a bit. If anything PCL is flexible to a fault. What do you want that this doesn't do?

stevemacenski gravatar image stevemacenski  ( 2020-03-11 11:16:01 -0500 )edit

I want to know which bin contains how many points and also the indices of the points in each bin. But, I am unable to get it using the PCL octree library. It will be helpful if give me some example of how to get it using PCL.

ee18mtech11025@iith.ac.in gravatar image ee18mtech11025@iith.ac.in  ( 2020-03-12 01:15:36 -0500 )edit

as this seems to be pretty much PCL specific, I suggest to ask at the PCL community directly. There is some overlap with ROS, but your are probably still reaching a better target audience there. Please link against your question there so it can be tracked down by users on ROS answers.

mgruhler gravatar image mgruhler  ( 2020-03-12 04:15:19 -0500 )edit