Computing the Maximum Detour of a Plane Graph in Subquadratic Time

  • Christian Wulff-Nilsen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5369)


Let G be a plane graph where each edge is a line segment. We consider the problem of computing the maximum detour of G, defined as the maximum over all pairs of distinct points p and q of G of the ratio between the distance between p and q in G and the distance |pq|. The fastest known algorithm for this problem has Θ(n 2) running time where n is the number of vertices. We show how to obtain O(n 3/2log3 n) expected running time. We also show that if G has bounded treewidth, its maximum detour can be computed in O(nlog3 n) expected time.


Short Path Recursive Call Geometric Graph Expected Time Dual Colour 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agarwal, P.K., Klein, R., Knauer, C., Langerman, S., Morin, P., Sharir, M., Soss, M.: Computing the Detour and Spanning Ratio of Paths, Trees and Cycles in 2D and 3D. Discrete and Computational Geometry 39(1), 17–37 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Caballo, S., Knauer, C.: Algorithms for Graphs With Bounded Treewidth Via Orthogonal Range Searching, Berlin (manuscript, 2007)Google Scholar
  3. 3.
    Chan, T.M.: Geometric applications of a randomized optimization technique. Discrete Comput. Geom. 22(4), 547–567 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Ebbers-Baumann, A., Klein, R., Langetepe, E., Lingas, A.: A Fast Algorithm for Approximating the Detour of a Polygonal Chain. Comput. Geom. Theory Appl. 27, 123–134 (2004)CrossRefzbMATHGoogle Scholar
  5. 5.
    Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425–461. Elsevier Science Publishers, Amsterdam (2000)CrossRefGoogle Scholar
  6. 6.
    Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16, 1004–1022 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Langerman, S., Morin, P., Soss, M.: Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees and Cycles. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 250–261. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Lipton, R.J., Tarjan, R.E.: A Separator Theorem for Planar Graphs. STAN-CS-77-627 (October 1977)Google Scholar
  9. 9.
    Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)CrossRefzbMATHGoogle Scholar
  10. 10.
    Smid, M.: Closest point problems in computational geometry. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 877–935. Elsevier Science Publishers, Amsterdam (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Christian Wulff-Nilsen
    • 1
  1. 1.Department of Computer ScienceUniversity of CopenhagenCopenhagen ODenmark

Personalised recommendations