Thanks! The canonical data structure to avoid the O(n^2) lookup is a kdtree, whi... | Hacker News

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

hythloday on Sept 23, 2012 | parent | context | favorite | on: Show HN: HTML5 Bird Flocks Simulation in CoffeeScr...

Thanks! The canonical data structure to avoid the O(n^2) lookup is a kdtree, which I think is reasonably easy to implement in coffeescript.

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