kdtree/quadtree vs GPU-picking

[dy]

GPU-picking

• 👎 takes time to create (measure)
  • we now calc snapped points for every 1e6 pointset update, that is slower than kdtree
• 👎 test how much time it takes to re-render the framebuffer
• 👎 picking is pretty slow O(N), reading from GPU
• 👎 obscures points within a range
• 👎 no mechanism of providing selection, so it happens O(N)

KD-tree

• 👎 takes time to initialize
• 👎 point updates force re-initializing the tree, which mb slow for 1e6 points (point diffs? quad-tree?)
• 👍 O(logN) picking time
• 👍 selects all points within a range
• 👍 fast selection (O(logN) for poly, box