Piecewise surface flattening for non-distorted texture mapping
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Parametrization and smooth approximation of surface triangulations
Computer Aided Geometric Design
Faster shortest-path algorithms for planar graphs
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Seamless texture mapping of subdivision surfaces by model pelting and texture blending
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Scaling up Dynamic Time Warping to Massive Dataset
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
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
Walking your dog in the woods in polynomial time
Proceedings of the twenty-fourth annual symposium on Computational geometry
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
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)
The frechet distance revisited and extended
Proceedings of the twenty-seventh annual symposium on Computational geometry
Computing the Fréchet distance between folded polygons
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Chroma Binary Similarity and Local Alignment Applied to Cover Song Identification
IEEE Transactions on Audio, Speech, and Language Processing
Measuring similarity between curves on 2-manifolds via homotopy area
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
We describe a O(log n)-approximation algorithm for computing the homotopic Frechet distance between two polygonal curves that lie on the boundary of a triangulated topological disk. Prior to this work, algorithms where known only for curves on the Euclidean plane with polygonal obstacles. A key technical ingredient in our analysis is a O(log n)-approximation algorithm for computing the minimum height of a homotopy between two curves. No algorithms were previously known for approximating this parameter. Surprisingly, it is not even known if computing either the homotopic Frechet distance, or the minimum height of a homotopy, is in NP.