Improved algorithms for partial Curve matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6942 LNCS, Issue , 2011, Pages 518-529

  Maheshwari, Anil ^a   Sack, Jörg Rüdiger ^a   Shahbaz, Kaveh ^a   Zarrabi Zadeh, Hamid ^a,b  

^a CARLETON UNIVERSITY   (Canada)

^b SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED CURVE; CURVE MATCHING; DECISION PROBLEMS; DIRECTED ACYCLIC GRAPHS; EFFICIENT ALGORITHM; FREE SPACE; IMPROVED ALGORITHM; MAP-MATCHING ALGORITHM; RUNNING TIME;

ALGORITHMS; DATA STRUCTURES;

IMAGE MATCHING;

EID: 80052810596     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23719-5_44     Document Type: Conference Paper

References (12)

1. Alt, H.: The computational geometry of comparing shapes. In: Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, pp. 235-248. Springer, Heidelberg (2009)
2. Alt, H., Efrat, A., Rote, G., Wenk, C.: Matching planar maps. J. Algorithms 49(2), 262-283 (2003)
3. Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. Int. J. of Comput. Geom. Appl. 5, 75-91 (1995)
4. Buchin, K., Buchin, M., Gudmundsson, J.: Constrained free space diagrams: a tool for trajectory analysis. Int. J. of Geogr. Inform. Sci. 24(7), 1101-1125 (2010)
5. Buchin, K., Buchin, M., Knauer, C., Rote, G., Wenk, C.: How difficult is it to walk the dog? In: Proc. 23rd EWCG, pp. 170-173 (2007)
6. Buchin, K., Buchin, M., Wang, Y.: Exact algorithms for partial curve matching via the Fréchet distance. In: Proc. 20th ACM-SIAM Sympos. Discrete Algorithms, pp. 645-654 (2009)
7. Cook, A.F., Wenk, C.: Geodesic Fréchet distance inside a simple polygon. In: Proc. 25th Sympos. Theoret. Aspects Comput. Sci. LNCS, vol. 5664, pp. 193-204 (2008)
8. Efrat, A., Guibas, L.J., Har-Peled, S., Mitchell, J.S.B., Murali, T.M.: New similarity measures between polylines with applications to morphing and polygon sweeping. Discrete Comput. Geom. 28(4), 535-569 (2002)
9. Jiang, M., Xu, Y., Zhu, B.: Protein structure-structure alignment with discrete Fr échet distance. J. Bioinform. Comput. Biol. 6(1), 51-64 (2008)
10. Maheshwari, A., Sack, J.-R., Shahbaz, K., Zarrabi-Zadeh, H.: Fréchet distance with speed limits. Comput. Geom. Theory Appl. 44(2), 110-120 (2011)
11. Maheshwari, A., Sack, J.-R., Shahbaz, K., Zarrabi-Zadeh, H.: Staying close to a curve. In: Proc. 23rd Canad. Conf. Computat. Geom. (to appear, 2011)
12. Sriraghavendra, E., Karthik, K., Bhattacharyya, C.: Fréchet distance based approach for searching online handwritten documents. In: Proc. 9th Internat. Conf. Document Anal. Recognition, pp. 461-465 (2007)