On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance

03/19/2022
by   Joachim Gudmundsson, et al.
0

We study the problem of sub-trajectory nearest-neighbor queries on polygonal curves under the continuous Fréchet distance. Given an n vertex trajectory P and an m vertex query trajectory Q, we seek to report a vertex-aligned sub-trajectory P' of P that is closest to Q, i.e. P' must start and end on contiguous vertices of P. Since in real data P typically contains a very large number of vertices, we focus on answering queries, without restrictions on P or Q, using only precomputed structures of 𝒪(n) size. We use three baseline algorithms from straightforward extensions of known work, however they have impractical performance on realistic inputs. Therefore, we propose a new Hierarchical Simplification Tree data structure and an adaptive clustering based query algorithm that efficiently explores relevant parts of P. The core of our query methods is a novel greedy-backtracking algorithm that solves the Fréchet decision problem using O(n+m) space and O(nm) time in the worst case. Experiments on real and synthetic data show that our heuristic effectively prunes the search space and greatly reduces computations compared to baseline approaches.

READ FULL TEXT

page 6

page 8

page 10

page 12

research
04/17/2020

On the Approximate Nearest Neighbor Queries among Curves under the Fréchet Distance

Approximate nearest neighbor search (ANNS) is a long-studied problem in ...
research
03/09/2018

TRAJEDI: Trajectory Dissimilarity

The vast increase in our ability to obtain and store trajectory data nec...
research
05/28/2020

A Practical Index Structure Supporting Fréchet Proximity Queries Among Trajectories

We present a scalable approach for range and k nearest neighbor queries ...
research
07/10/2017

Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon

We present an efficient dynamic data structure that supports geodesic ne...
research
05/27/2019

Learning to Route in Similarity Graphs

Recently similarity graphs became the leading paradigm for efficient nea...
research
04/24/2019

Efficient Nearest-Neighbor Query and Clustering of Planar Curves

We study two fundamental problems dealing with curves in the plane, name...
research
02/24/2020

Relaxing Relationship Queries on Graph Data

In many domains we have witnessed the need to search a large entity-rela...

Please sign up or login with your details

Forgot password? Click here to reset