Difference between revisions of "Thread:Talk:Rolling Averages/Rolling KD-Tree?/reply (3)"
Jump to navigation
Jump to search
(Reply to Rolling KD-Tree?) |
m |
||
| Line 1: | Line 1: | ||
| − | Adding point removal isn't hard, the hard thing is to keep the right tree structure, which I haven't seen in most implementation. | + | Adding point removal isn't hard, the hard thing is to keep the right tree structure, which I haven't seen in most implementation, which is necessary to keep the tree performant. |
Removing a point is essentially searching it as normal, and iterates through each of the bucket and erase it. | Removing a point is essentially searching it as normal, and iterates through each of the bucket and erase it. | ||
Revision as of 05:36, 8 August 2021
Adding point removal isn't hard, the hard thing is to keep the right tree structure, which I haven't seen in most implementation, which is necessary to keep the tree performant.
Removing a point is essentially searching it as normal, and iterates through each of the bucket and erase it.
