Randomized optimal algorithm for slope selection
Information Processing Letters
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
Parametric search made practical
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
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 Based Approach for Searching Online Handwritten Documents
ICDAR '07 Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01
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
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
Geodesic Fréchet distance inside a simple polygon
ACM Transactions on Algorithms (TALG)
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
Improved algorithms for partial curve matching
ESA'11 Proceedings of the 19th European conference on Algorithms
| Hi-index | 0.00 |
Given two simplicial complexes in Rd and start and end vertices in each complex, we show how to compute curves (in each complex) between these vertices, such that the weak Fréchet distance between these curves is minimized. As a polygonal curve is a complex, this generalizes the regular notion of weak Fréchet distance between curves. We also generalize the algorithm to handle an input of k simplicial complexes. Using this new algorithm, we can solve a slew of new problems, from computing a mean curve for a given collection of curves to various motion planning problems. Additionally, we show that for the mean curve problem, when the k input curves are c-packed, one can (1+ϵ-approximate the mean curve in near-linear time, for fixed k and ϵ. Additionally, we present an algorithm for computing the strong Fréchet distance between two curves, which is simpler than previous algorithms and avoids using parametric search.