Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Jordanpomeroy
on Feb 11, 2018
|
parent
|
context
|
favorite
| on:
Using k-d trees to efficiently calculate nearest n...
If I remember correctly these things don’t do well with dynamic updates, right? Don’t you have to rebuild the whole tree for every update?
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
