Krumblog personal blog
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.
- Points
- 190
- HN comments
- 40
- Submissions
- 1
- Cited by
- 0 commenters
Math & AlgorithmsSoftware Engineering2018
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Feb 10, 2018 | Using k-d trees to efficiently calculate nearest neighbors in 3D vector space by nkurz | 190 | 40 |
