Before revision:  A relevant operation on curves is similarity search : given a dataset S of curves , construct a data structure that, for any query curve q, finds the curves in S similar to q. Similarity search is a computational demanding task, in particular when a robust distance function is used, such as the continuous Fr\'echet distance. In this paper, we propose FRESH, a novel approximate solution to find similar curves under the continuous Fr\'echet distance.
After revision:  A relevant operation on curves is similarity search : given a dataset S of curves , construct a data structure that, for any query curve q, efficiently returns all entries in S with distance at most r from q. We propose FRESH, a novel approximate solution to find similar curves under the continuous Fr\'echet distance.