Before revision:  We also show that the existence of an incremental algorithm with the time complexity o(n^3) for two-dimensional trajectories is unlikely .
After revision:  Our algorithm runs in O(kn^2), where k depends on \epsilon and the ratio of the duration of trajectory to the maximum amount of gap time .