Loading...

Staying close to a curve

Maheshwari, A ; Sharif University of Technology

307 Viewed
  1. Type of Document: Article
  2. Abstract:
  3. Given a point set S and a polygonal curve P in Rd, we study the problem of finding a polygonal curve through S, which has minimum Fréchet distance to P. We present an efficient algorithm to solve the decision version of this problem in O(nk2) time, where n and k represent the sizes of P and S, respectively. A curve minimizing the Fréchet distance can be computed in O(nk2 log(nk)) time. As a by-product, we improve the map matching algorithm of Alt et al. by an O(log k) factor for the case when the map is a complete grap
  4. Keywords:
  5. Complete graphs ; Decision version ; Map-matching algorithm ; Point set ; Polygonal curve ; Algorithms ; Computational geometry
  6. Source: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011, 10 August 2011 through 12 August 2011 ; 2011
  7. URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.8498