Abstract
By folding the free-space diagram for efficient preprocessing, we show that the Fréchet distance between 1D curves can be computed in $O(nk log n)$ time, assuming one of the curves has ply $k$.
Original language | English |
---|---|
Title of host publication | Proc. 32nd Symposium on Computational Geometry |
Publication status | Published - 2017 |
Keywords
- CG, GRAPH, TRAJ