News for hackers. Stuff that matters.
Re:VP trees: A data structure for finding stuff fast by willvarfar on Friday December 02, 2011 @04:11PM (#3305698)
3D spatial problems are just three dimensions. True you can do that with VP but you can do that with octtree too.

Imagine beyond 3D like clustering of friends or likes or recommendations or all those other N-dimensional data-points and you'll see the overlap.

Re:VP trees: A data structure for finding stuff fast by joshu on Saturday December 03, 2011 @02:09AM (#3307167)
Right. There are plenty of cases where you ONLY have the distance (or similarity) between two points and don't actually have an n-dimensional point in space.