Skip to main content
SpringerLink
Log in

Fréchet Distance Problems in Weighted Regions

  • Conference paper
Algorithms and Computation (ISAAC 2009)

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

Included in the following conference series:

Abstract

We discuss two versions of the Fréchet distance problem in weighted planar subdivisions. In the first one, the distance between two points is the weighted length of the line segment joining the points. In the second one, the distance between two points is the length of the shortest path between the points. In both cases we give algorithms for finding a (1 + ε)-factor approximation of the Fréchet distance between two polygonal curves. We also consider the Fréchet distance between two polygonal curves among polyhedral obstacles in \(\mathcal{R}^3\) (1/ ∞ weighted region problem) and present a (1 + ε)-factor approximation algorithm.

This work was supported in part by NSF award CCF-0635013.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Aleksandrov, L., Djidjev, H.N., Guo, H., Maheshwari, A., Nussbaum, D., Sack, J.: Approximate shortest path queries on weighted polyhedral surfaces. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 98–109. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Aleksandrov, L., Maheshwari, A.A., Sack, J.R.: Approximation algorithms for geometric shortest path problems. In: Proc. 32nd Annual ACM Symposium on Theory of Computing, pp. 286–295 (2000)

    Google Scholar 

  3. Aleksandrov, L., Maheshwari, A., Sack, J.: Determining approximate shortest paths on weighted polyhedral surfaces. Journal of the ACM 52(1), 25–53 (2005)

    Article  MathSciNet  Google Scholar 

  4. Alt, H., Godau, M.: Computation the Fréchet distance between two polygonal curves. International Journal of Computational Geometry and Applications 5, 75–91 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  5. Amato, N.M., Goodrich, M.T., Ramos, E.A.: Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling. In: Proc. 11th Annual CAM-SIAM Symposium on Discrete Algorithms, pp. 705–706 (2000)

    Google Scholar 

  6. Buchin, K., Buchin, M., Wenk, C.: Computing the Fréchet distance between simple polygons in polynomial time. In: Proc. 22nd Symposium on Computational Geometry, pp. 80–87 (2006)

    Google Scholar 

  7. Buchin, K., Buchin, M., Wang, Y.: Exact partial curve matching under the Fréchet distance. In: Proc. ACM-SIAM Symposium on Discrete Algorithms (to appear, 2009)

    Google Scholar 

  8. Chambers, E.W., De Verdière,C. É., Erickson, J., Lazard, S., Lazarus, F., Thite, S.: Walking your dog in the woods in polynomial time. In: Proc. 24th Annual ACM Symposium on Computational Geometry, pp. 101–109 (2008)

    Google Scholar 

  9. Chen, D.Z., Daescu, O., Hu, X., Wu, X., Xu, J.: Determining an optimal penetration among weighted regions in two and three dimensions. J. combinat. Optim. 5(1), 59–79 (2001)

    Article  MathSciNet  Google Scholar 

  10. Cheng, S.W., Na, H.S., Vigneron, A., Wang, Y.: Approximate shortest paths in anisotropic regions. In: Proc. 18th annual ACM-SIAM symposium on Discrete algorithms, pp. 766–774 (2007)

    Google Scholar 

  11. Cheng, S.W., Na, H.S., Vigneron, A., Wang, Y.: Querying approximate shortest paths in anisotropic regions. In: Proc. 23rd annual symposium on Computational geometry, pp. 84–91 (2005)

    Google Scholar 

  12. Clarkson, K.L.: Approximation algorithms for shortest path motion planning. In: Proc. 19th Annual ACM Symposium on Theory of Computing, pp. 56–65 (1987)

    Google Scholar 

  13. Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134–183. Springer, Heidelberg (1975)

    Google Scholar 

  14. Cook IV, A.F., Wenk, C.: Geodesic Fréchet distance inside a simple polygon. In: Proc. 25th International Symposium on Theoretical Aspects of Computer Science, pp. 193–204 (2008)

    Google Scholar 

  15. Eiter, T., Mannila, H.: Computing discrete Fréchet distance. Technical Report CD-TR 94/64, Information Systems Department, Technical University of Vienna (1994)

    Google Scholar 

  16. Fréchet, M.: Sur quelques points du calcul fonctionnel. Rendiconti del Circolo Mathematico di Palermo 22, 1–74 (1906)

    Article  Google Scholar 

  17. Maheshwari, A., Yi, J.: On computing Fréchet distance of two paths on a convex polyhedron. In: Proc. 21st European Workshop on computational Geometry, pp. 41–44 (2005)

    Google Scholar 

  18. Mitchell, J.S.B., Papadimitriou, C.H.: The weighted region problem: Finding shortest paths through a weighted planer subdivision. Journal of the ACM 38(1), 18–73 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  19. Rote, G.: Computing the Fréchet distance between piecewise smooth curves. Technical Report, ECGTR-241108-01 (2005)

    Google Scholar 

  20. Sun, Z., Reif, J.H.: On finding approximate optimal path in weighted regions. Journal of Algorithms 58(1), 1–32 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  21. Beer-Lambert law. Wikipedia, http://en.wikipedia.org/wiki/BeerLambert_law

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA

    Yam Ki Cheung & Ovidiu Daescu

Authors
  1. Yam Ki Cheung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ovidiu Daescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electrical and Computer Engineering, University of Hawaii, Holmes Hall 483, 2540 Dole Street, 96822, Honolulu, HI, USA

    Yingfei Dong

  2. Department of Computer Science, University of Texas at Dallas, 75083, Dallas, TX, USA

    Ding-Zhu Du

  3. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cheung, Y.K., Daescu, O. (2009). Fréchet Distance Problems in Weighted Regions. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10631-6_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10630-9

  • Online ISBN: 978-3-642-10631-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation