Hi everyone, I am looking for a Python package that can do arbitrary and efficient cross-matching of source lists, i.e. some kind of kd-tree that uses spherical rather than euclidean distances. Is anyone aware of such a package? Thanks, Tom