Before revision:  In this paper, we revisit the problem in the presence of curves under the  Fr\'echet distance \Reals . Given a set  P of n curves of size at most m each in \mathbb{R \Reals and a real  \delta>0, we aim to preprocess  P into a data structure so that for any given query curve Q of size k,  report all curves in  P whose Fr\'echet distances to Q are at most \delta.
After revision:  In this paper, we revisit the problem in the presence of curves under the Fr\'echet distance \Reals . Given a set  P of n curves of size at most m each in \mathbb{R \Reals and a real \delta>0, we aim to preprocess  P into a data structure so that for any given query curve Q of size k, we can efficiently report all curves in  P whose Fr\'echet distances to Q are at most \delta.