Difference between revisions of "Thread:Talk:Rolling Averages/Rolling KD-Tree?/reply (3)"

From Robowiki
Jump to navigation Jump to search
m
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, which is necessary to keep the tree performant.
 
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 iterating through each of the bucket and erase it.
+
Removing a point is essentially:
 +
# search it as normal.
 +
# iterate through each of the bucket and erases it.

Latest revision as of 06:37, 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:

  1. search it as normal.
  2. iterate through each of the bucket and erases it.