Approximate map matching with respect to the Fréchet distance

2011 Proceedings of the 13th Workshop on Algorithm Engineering and Experiments, ALENEX 2011

Volumn , Issue , 2011, Pages 75-83

  Chen, Daniel ^a   Driemel, Anne ^b   Guibas, Leonidas J ^a   Nguyen, Andy ^a   Wenk, Carola ^c  

^a Stanford University   (United States)

^b UTRECHT UNIVERSITY   (Netherlands)

^c One UTSA Circle   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CURVE FITTING; CURVES (ROAD);

APPROXIMATE MATCHING; CURVE SIMPLIFICATION; EMBEDDED GRAPHS; EXACT MATCHING; EXPERIMENTAL EVIDENCE; NEAR-LINEAR TIME; ROAD NETWORK; THEORETICAL BOUNDS;

APPROXIMATION ALGORITHMS;

EID: 84863056465     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972917.8     Document Type: Conference Paper

References (12)

1. H. Alt, A. Efrat, G. Rote, and C. Wenk, Matching planar maps, J. Algorithms, 49 (2003), pp. 262-283.
2. H. Alt and M. Godau, Computing the Fréchet distance between two polygonal curves, Internat. J. Comput. Geom. Appl., 5 (1995), pp. 75-91.
3. S. Brakatsoulas, D. Pfoser, R. Salas, and C. Wenk, On Map-Matching Vehicle Tracking Data, in Proc. 31st VLDB Conference, 2005, pp. 853-864.
4. P. B. Callahan and S. R. Kosaraju, A decomposition of multidimensional point sets with applications to knearestneighbors and n-body potential fields, J. Assoc. Comput. Mach., 42 (1995), pp. 67-90.
5. M. de Berg, Linear size binary space partitions for uncluttered scenes, Algorithmica, 28 (2000), pp. 353366.
6. M. de Berg, M. J. Katz, A F. van der Stappen, and J. Vleugels, Realistic Input Models for Geometric Algorithms, Algorithmica, 34 (2002), pp. 81-97.
7. A. Driemel, S. Har-Peled, and C.Wenk, Approximating the Fréchet Distance for Realistic Curves in Near Linear Time, in Proc. 26th Annu. ACM Sympos. Comput. Geom., 2010.
8. M. H. Overmars and A. F. van der Stappen, Range searching and point location among fat objects, J. Algorithms, 21:3 (1996), pp. 629-656.
9. D. Pfoser, S. Brakatsoulas, P. Brosch, M. Umlauft, N. Tryfona, and G. Tsironis, Dynamic travel time provision for road networks, in Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems (ACM GIS), 2008.
10. O. Schwarzkopf and J. Vleugels, Range searching in low-density environments, Inf. Process. Lett., 60:3 (1996), pp. 121-127.
11. J. Vleugels, On Fatness and Fitness Realistic Input Models for Geometric Algorithms, PhD thesis, Dept. Comput. Sci., Utrecht Univ., Utrecht, the Netherlands, 1997.
12. C. Wenk, R. Salas, and D. Pfoser, Addressing the Need for Map-Matching Speed: Localizing Global CurveMatching Algorithms, in Proc. 18th Int. Conf. Sci. Statis. Database Manag., 2006, pp. 879-888.