undefined | Better HN

0 pointsarman_ashrafian6y ago0 comments

I’m taking Advanced Data Structures at UCSD right now and our first assignment was making a K-D Tree and an efficient KNN Classifier. It was surprisingly simple and the efficiency between the KD Tree and brute force implementation was quite drastic.

If you only build the tree once and do no insertions what is the benefit of an R-Tree vs KDTree?

0 comments

petschge6y ago

I actually do plan to update the tree as I insert additional particles in locations where the distance to the nearest neighbor is large.

j / k navigate · click thread line to collapse

0 pointsarman_ashrafian6y ago0 comments

If you only build the tree once and do no insertions what is the benefit of an R-Tree vs KDTree?

0 comments

petschge6y ago

I actually do plan to update the tree as I insert additional particles in locations where the distance to the nearest neighbor is large.

j / k navigate · click thread line to collapse