Skip to content
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

can this kdtree delete points lightweight without reconstruct a new kdtree #4

Closed
xieqi1 opened this issue Mar 12, 2021 · 3 comments
Closed

Comments

@xieqi1
Copy link

xieqi1 commented Mar 12, 2021

hi
Thanks for sharing your work, it is a great improvement that make kdtree cost less time when add new points, however, if I want to delete some points, can this framework handle without build a new kdtree?

@XW-HKU
Copy link
Member

XW-HKU commented Mar 13, 2021

yes, of course. ikdtree supports add, delete, search and grid downsample.

@Ecstasy-EC
Copy link
Member

Yes, the ikd-Tree supports both point-wise and box-wise delete as memtioned in our preprint papaer. Please refer to our demo cpp for further information.

@xieqi1
Copy link
Author

xieqi1 commented Mar 14, 2021

That's great, I will take a close look at this work.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants