neighbour performance
performance of the neighbour algorithm can trivially be reduced by appling the inverse of the arccosh to the search distance. perhaps one might leave out the arccosh alltogether and only compare simple Lorentzian distances
performance of the neighbour algorithm can trivially be reduced by appling the inverse of the arccosh to the search distance. perhaps one might leave out the arccosh alltogether and only compare simple Lorentzian distances