Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

There is a library called flann that does approximate nearest neighbors using a kd-tree and best bin first method. It is typically used not only for nearest neighbors but finding them in higher dimensions.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: