You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This should result in the closest point at (0.5, 0.5, 0.5) with a distance value of 0.
However, the code results in a different value (based on the original random closest point).
This behavior only happens if I try to re-add a previously removed index.
Can someone explain why this is happening? Is this a Bug?
The text was updated successfully, but these errors were encountered:
Thoughts on two points are welcomed (please comments on PR):
treeIndex is now a hash map instead of a vector, so it's expected to be slower. A vector<bool> could be used instead of a hashmap to alleviate this but depending on how points are loaded in the index this may mean extra space. does any other alternative comes to mind folks?
The semantic of the argument void removePoint(size_t idx) changed. Previously that index referred to the order in which points were added to the set, now it's the same index space as the arguments of function void addPoints(AccessorType start, AccessorType end) (in other words, previously if the first bunch of points added are addPoints(100, 200), and I wanted to delete point with index 100, I would have to do remove(0), currently I have to do remove(100) )
I tried to add the removed index at
nanoflann/examples/dynamic_pointcloud_example.cpp
Lines 69 to 70 in 4c47ca2
by adding the following code:
This should result in the closest point at (0.5, 0.5, 0.5) with a distance value of 0.
However, the code results in a different value (based on the original random closest point).
This behavior only happens if I try to re-add a previously removed index.
Can someone explain why this is happening? Is this a Bug?
The text was updated successfully, but these errors were encountered: