Curve Matching, Time Warping, and Light Fields: New Algorithms for Computing Similarity between Curves
- 30 November 2006
- journal article
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 27 (3) , 203-216
- https://doi.org/10.1007/s10851-006-0647-0
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Matching planar mapsJournal of Algorithms, 2003
- Visual identification by signature trackingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Efficient Algorithms for Approximating Polygonal ChainsDiscrete & Computational Geometry, 2000
- Fast Marching MethodsSIAM Review, 1999
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHSInternational Journal of Computational Geometry & Applications, 1996
- Approximate matching of polygonal shapesAnnals of Mathematics and Artificial Intelligence, 1995
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVESInternational Journal of Computational Geometry & Applications, 1995
- An efficiently computable metric for comparing polygonal shapesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- The Discrete Geodesic ProblemSIAM Journal on Computing, 1987
- A note on two problems in connexion with graphsNumerische Mathematik, 1959