Scaling up Dynamic Time Warping to Massive Dataset
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Journal of Algorithms
Comparison of Distance Measures for Planar Curves
Algorithmica
The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
SIAM Journal on Computing
Optimization of subsequence matching under time warping in time-series databases
Proceedings of the 2005 ACM symposium on Applied computing
On map-matching vehicle tracking data
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Addressing the Need for Map-Matching Speed: Localizing Globalb Curve-Matching Algorithms
SSDBM '06 Proceedings of the 18th International Conference on Scientific and Statistical Database Management
Fréchet distance for curves, revisited
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Fréchet Distance Based Approach for Searching Online Handwritten Documents
ICDAR '07 Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01
Improved Bounds on the Union Complexity of Fat Objects
Discrete & Computational Geometry
On Approximating the Depth and Related Problems
SIAM Journal on Computing
Detecting single file movement
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Detecting Commuting Patterns by Clustering Subtrajectories
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
The Computational Geometry of Comparing Shapes
Efficient Algorithms
Can We Compute the Similarity between Surfaces?
Discrete & Computational Geometry
Approximating the Fréchet distance for realistic curves in near linear time
Proceedings of the twenty-sixth annual symposium on Computational geometry
A note on the perimeter of fat objects
Computational Geometry: Theory and Applications
Approximating the Fréchet distance for realistic curves in near linear time
Proceedings of the twenty-sixth annual symposium on Computational geometry
A near-linear time guaranteed algorithm for digital curve simplification under the Fréchet distance
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
The frechet distance revisited and extended
Proceedings of the twenty-seventh annual symposium on Computational geometry
Jaywalking your dog: computing the Fréchet distance with shortcuts
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
How to walk your dog in the mountains with no magic leash
Proceedings of the twenty-eighth annual symposium on Computational geometry
A GPU approach to subtrajectory clustering using the Fréchet distance
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Computational Geometry: Theory and Applications
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 |
We present a simple and practical (1+ε)-approximation algorithm for the Fréchet distance between polygonal curves. To analyze this algorithm we introduce a new realistic family of curves, c-packed curves, that is closed under simplification. We believe the notion of c-packed curves to be of independent interest. We show that our algorithm has near linear running time for c-packed polygonal curves, and show similar results for other input models, such as low density.