News for hackers. Stuff that matters.
Re:VP trees: A data structure for finding stuff fast by pornel on Friday December 02, 2011 @06:07PM (#3306163)
The cool thing about VP trees is that your space doesn't have to be Euclidean, i.e. you can have dimensions that depend on other dimensions, e.g. in RGBA color space values of RGB are meaningless when A=transparent. You can't search that space with KD trees, but you can with VP trees.

There are no comments on this comment yet.