Skip to main content
SpringerLink
Log in

Fréchet-Distance on Road Networks

  • Conference paper
Computational Geometry, Graphs and Applications (CGGA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7033))

Abstract

As a measure for the resemblance of tracks in a network graph, we consider the so-called Fréechet-distance based on network distance. For paths P and Q consisting of p and q consecutive edges, an O((p 2 + q 2)logpq) time algorithm measuring the Fréechet-distance between P and Q is developed. Then some important variants are investigated, namely weak Fréechet distance, discrete Fréechet distance , all based on the network distance.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alt, H., Buchin, M.: Semi-computability of the fréchet distance between surfaces. In: EuroCG, pp. 45–48 (2005)

    Google Scholar 

  2. Alt, H., Efrat, A., Rote, G., Wenk, C.: Matching planar maps. In: SODA, pp. 589–598 (2003)

    Google Scholar 

  3. Alt, H., Godau, M.: Computing the fréchet distance between two polygonal curves. Int. J. Comput. Geometry Appl. 5, 75–91 (1995)

    Article  MATH  Google Scholar 

  4. Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: VLDB 2005: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 853–864. VLDB Endowment (2005)

    Google Scholar 

  5. Buchin, K., Buchin, M., Wenk, C.: Computing the fréchet distance between simple polygons. Comput. Geom. Theory Appl. 41(1-2), 2–20 (2008)

    Article  MATH  Google Scholar 

  6. Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34(1), 200–208 (1987)

    Article  MathSciNet  Google Scholar 

  7. Eiter, T., Mannila, H.: Computing discrete fréchet distance. Technical report, Technische Universitat Wien (1994)

    Google Scholar 

  8. Klein, P., Rao, S., Rauch, M., Subramanian, S.: Faster shortest-path algorithms for planar graphs. In: STOC 1994: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, pp. 27–37. ACM, New York (1994)

    Chapter  Google Scholar 

  9. Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30(4), 852–865 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  10. Rote, G.: Computing the fréchet distance between piecewise smooth curves. Comput. Geom. Theory Appl. 37(3), 162–174 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China

    Chenglin Fan & Jun Luo

  2. School of Information Science and Engineering, Central South University, Changsha, China

    Chenglin Fan

  3. Department of Computer Science, Montana State University, Bozeman, MT59717, USA

    Binhai Zhu

Authors
  1. Chenglin Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Binhai Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Institute of Education, Tokai University, 2-28-4 Tomigaya, Tokio, Shibuya-ku, Japan

    Jin Akiyama

  2. School of Computer Science and Technology, Dalian Maritime University, 116026, Dalian, China

    Jiang Bo

  3. Ibaraki University, Nakanarusawa, 316-8511, Hitachi, Ibaraki, Japan

    Mikio Kano

  4. Tokai University, 4-1-1 Kitakaname, 259-1292, Hiratsuka, Japan

    Xuehou Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fan, C., Luo, J., Zhu, B. (2011). Fréchet-Distance on Road Networks. In: Akiyama, J., Bo, J., Kano, M., Tan, X. (eds) Computational Geometry, Graphs and Applications. CGGA 2010. Lecture Notes in Computer Science, vol 7033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24983-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24983-9_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24982-2

  • Online ISBN: 978-3-642-24983-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation