1
Using k-d trees to efficiently calculate nearest neighbors in 3D vector space
What would the world look like if there were only 16 colors? I use k-d trees to perform nearest neighbor search to find out.
Krumblog
Thoughts and ideas from software developers, platform engineers, and designers doing the work.
- Popular posts
- 1
- Total points
- 190
- HN comments
- 40
- Rank
- #13,266 personal
Visit blog.krum.io → RSS feedOn Hacker News Feb 2018 – Feb 2018