2 ms·
Ask HN: k-nearest neighbour search with circular dimensions
I'm trying to figure out how to do a k-nearest neighbour search where some of the dimensions are 'circular', e.g. closed loops. Is this possible? Anybody got any clues or want to get paid to implement it?