 In this paper, we revisit the problem in the presence of curves under the  Fr\'echet distance \Reals . Given a set %DIFDELCMD < {\cal %%% P of n curves of size at most m each in \mathbb{R \Reals and a real  \delta>0, we aim to preprocess %DIFDELCMD < {\cal %%% P into a data structure so that for any given query curve Q of size k,  report all curves in %DIFDELCMD < {\cal %%% P whose Fr\'echet distances to Q are at most \delta.
<meaning-changed>  In this paper, we revisit the problem in the presence of curves under the  Fr\'echet distance \Reals . Given a set %DIFDELCMD < {\cal %%% P of n curves of size at most m each in \mathbb{R \Reals and a real  \delta>0, we aim to preprocess %DIFDELCMD < {\cal %%% P into a data structure so that for any given query curve Q of size k,  report all curves in %DIFDELCMD < {\cal %%% P whose Fr\'echet distances to Q are at most \delta.
 In this paper, we revisit the problem in the presence of curves under the (continuous) Fr\'echet distance \Reals . Given a set %DIFDELCMD < {\cal %%% P of n curves of size at most m each in \mathbb{R \Reals and a real \delta>0, we aim to preprocess %DIFDELCMD < {\cal %%% P into a data structure so that for any given query curve Q of size k, report all curves in %DIFDELCMD < {\cal %%% P whose Fr\'echet distances to Q are at most \delta.