L-infinity interdistance selection by parametric search
Information Processing Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Applications of parametric searching in geometric optimization
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Generalized self-approaching curves
Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
Approximate nearest neighbor algorithms for Frechet distance via product metrics
Proceedings of the eighteenth annual symposium on Computational geometry
Scaling up Dynamic Time Warping to Massive Dataset
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Matching Polygonal Curves with Respect to the Fréchet Distance
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Algorithmic Aspects of Protein Structure Similarity
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Journal of Algorithms
Comparison of Distance Measures for Planar Curves
Algorithmica
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
Computing the Fréchet distance between simple polygons in polynomial time
Proceedings of the twenty-second annual symposium on Computational geometry
A data structure for orthogonal range queries
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Approximately matching polygonal curves with respect to the Fréchet distance
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Dynamics-aware similarity of moving objects trajectories
Proceedings of the 15th annual ACM international symposium 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
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
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
Link distance and shortest path problems in the plane
Computational Geometry: Theory and Applications
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Similarity in (spatial, temporal and) spatio-temporal datasets
Proceedings of the 15th International Conference on Extending Database Technology
A polynomial time solution for protein chain pair simplification under the discrete fréchet distance
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
Computational Geometry: Theory and Applications
Measuring similarity between curves on 2-manifolds via homotopy area
Proceedings of the twenty-ninth annual symposium on Computational geometry
Journal of Biomedical Imaging - Special issue on Advanced Signal Processing Methods for Biomedical Imaging
Protein Chain Pair Simplification under the Discrete Fréchet Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
We revisit the problem of computing the Fréchet distance between polygonal curves, focusing on the discrete Fréchet distance, where only distance between vertices is considered. We develop efficient approximation algorithms for two natural classes of curves: κ-bounded curves and backbone curves, the latter of which are widely used to model molecular structures. We also propose a pseudo-output-sensitive algorithm for computing the discrete Fréchet distance exactly. The complexity of the algorithm is a function of the complexity of the free-space boundary, which is quadratic in the worst case, but tends to be lower in practice.