Papers › On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
Joachim Gudmundsson, John Pfeifer, Martin P. Seybold
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study the problem of sub-trajectory nearest-neighbor queries on polygonal curves under the continuous Fr\'echet 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\'echet 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections