3 ms·
sounds a lot like gaussian kd-trees http://graphics.stanford.edu/papers/gkdtrees/gkdtrees.pdf http://graphics.stanford.edu/papers/gkdtrees/gkdtrees.pdf Instea
by CyberDildonics 11y ago
sounds a lot like gaussian kd-trees
http://graphics.stanford.edu/papers/gkdtrees/gkdtrees.pdf http://graphics.stanford.edu/papers/gkdtrees/gkdtrees.pdf
Instead of doing a brute force nearest neighbor search, samples are propagated through a tree.
This technique is exotic, but not new.