Detecting single file movement
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Exact algorithms for partial curve matching via the Fréchet distance
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating the Fréchet distance for realistic curves in near linear time
Proceedings of the twenty-sixth annual symposium on Computational geometry
Fréchet distance of surfaces: some simple hard cases
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
The frechet distance revisited and extended
Proceedings of the twenty-seventh annual symposium on Computational geometry
Finding long and similar parts of trajectories
Computational Geometry: Theory and Applications
Jaywalking your dog: computing the Fréchet distance with shortcuts
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Mining trajectory corridors using fréchet distance and meshing grids
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
How to walk your dog in the mountains with no magic leash
Proceedings of the twenty-eighth annual symposium on Computational geometry
Dynamic k-means: a clustering technique for moving object trajectories
International Journal of Intelligent Information and Database Systems
Mining sub-trajectory cliques to find frequent routes
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
The fréchet distance revisited and extended
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
In this talk I will present a new direction of algorithms whichdo not use any extra working array. More formally, we want todesign efficient algorithms which require no extra array of sizedepending on input size n but use only constant ...