-
Notifications
You must be signed in to change notification settings - Fork 308
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
On the implementation of neighborhood search #29
Comments
That comment was written by the author of the original NDT code in PCL. In that code, a strange neighborhood pattern was used for direct search (26 voxels: 3x3x3 except for center), and it largely affected the processing speed. I tried to replace it with more reasonable patterns (DIRECT1/7) and observed that in this setting direct search works better than radius search. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Hi,
I am quite curious about the implementation in neighborhood search. As stated in this comment, radius search by kd-tree is experimentally faster than direct search by voxel hashing. This is quite different from the intuition that complexity for searching with kd-tree and voxel hashing are O(log(n)) and O(1), respectively. Any hints for this?
The text was updated successfully, but these errors were encountered: