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

Higher dimensional algorithms get very messy - see X-trees vs R-trees.

E.g., KNN is very fast, if and only if you have a high performing R-tree query.

so while the 2d algos might "fall out" of the sophisticated cases, the sophisticated cases will need to go in a different optimization direction.




Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4

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

Search: