A Dynamic Data Structure for Approximate Proximity Queries in Trajectory Data
Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi · 2017
Let S be a set of n polygonal trajectories in the plane and k be a fixed constant. We present a data structure to store S so that, given a k-vertex query trajectory Q, we can answer the following queries approximately: