Can I use arbitrary metrics to search KD-Trees?

Question

I just finished implementing a kd-tree for doing fast nearest neighbor searches. I\'m interested in playing around with different distance metrics other than the Euclidean d

Answer 1

I don't think you're tied to euclidean distance - as j_random_hacker says, you can probably use Manhattan distance - but I'm pretty sure you're tied to geometries that can be represented in cartesian coordinates. So you couldn't use a kd-tree to index a metric space, for example.