Staying close to a curve

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011

Volumn , Issue , 2011, Pages

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

^a CARLETON UNIVERSITY   (Canada)

^b SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE GRAPHS; DECISION VERSION; MAP-MATCHING ALGORITHM; POINT SET; POLYGONAL CURVE;

ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 84882968243     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. H. Alt, A. Efrat, G. Rote, and C.Wenk. Matching planar maps. J. Algorithms, 49(2):262-283, 2003.
2. H. Alt and M. Godau. Computing the Fréchet distance between two polygonal curves. Int. J. of Comput. Geom. Appl., 5:75-91, 1995.
3. K. Buchin, M. Buchin, C. Knauer, G. Rote, and C. Wenk. How dificult is it to walk the dog? In Proc. 23rd European Workshop Comput. Geom., pages 170- 173, 2007.