I am looking for data-structures to store efficiently a set of points $E$ in an euclidean space of dimension $d$. In particular, I would like to be able to solve the problem of finding all the point within a ball of center p and radius n without exploring all the points of $E$.
- First remark that it depends of the choice of the distance: it is much more easier for the Chebyshev distance since a simple b-tree over each coordinates would be sufficient.
- Also remark that I would be happy if finding those points is FPT with the $d$ (dimension) as a parameter.
I guess it is well-known-well-studied problem, but I didn't find anything after a (rather short) bibliographical search?