Approximate Distance Queries for Weighted Polyhedral Surfaces

  • Hristo N. Djidjev
  • Christian Sommer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6942)

Abstract

Let P be a planar polyhedral surface consisting of n triangular faces, each assigned with a positive weight. The weight of a path p on P is defined as the weighted sum of the Euclidean lengths of the portions of p in each face multiplied by the corresponding face weights. We show that, for every ε ∈ (0,1), there exists a data structure, termed distance oracle, computable in time O(− 2log3(n/ε)log2(1/ε)) and of size O(− 3/2log2(n/ε)log(1/ε)), such that (1 + ε)–approximate distance queries in P can be answered in time O(ε− 1log(1/ε) + loglogn). As in previous work (Aleksandrov, Maheshwari, and Sack (J. ACM 2005) and others), the big–O notation hides constants depending logarithmically on the ratio of the largest and smallest face weights and reciprocally on the sine of the smallest angle of P. The tradeoff between space and query time of our distance oracle is a significant improvement in terms of n over the previous best tradeoff obtained by a distance oracle of Aleksandrov, Djidjev, Guo, Maheshwari, Nussbaum, and Sack (Discrete Comput. Geom. 2010), which requires space roughly quadratic in n for a comparable query time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abraham, I., Gavoille, C.: Object location using path separators. In: PODC, pp. 188–197 (2006)Google Scholar
  2. 2.
    Aleksandrov, L., Djidjev, H.N., Guo, H., Maheshwari, A., Nussbaum, D., Sack, J.R.: Algorithms for approximate shortest path queries on weighted polyhedral surfaces. Discrete Comput. Geom. 44, 762–801 (2010)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Aleksandrov, L., Maheshwari, A., Sack, J.R.: Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM 52(1), 25–53 (2005)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Cabello, S.: Many distances in planar graphs. In: SODA, pp. 1213–1220 (2006); a preprint of the Journal version is available in the University of Ljubljana preprint series 47, 1089 (2009)Google Scholar
  5. 5.
    Djidjev, H.: Efficient algorithms for shortest path queries in planar digraphs. Graph-Theoretic Concepts in Computer Science 1197, 151–165 (1997)MathSciNetGoogle Scholar
  6. 6.
    Fakcharoenphol, J., Rao, S.: Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci. 72(5), 868–889 (2006)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Kawarabayashi, K.-i., Klein, P.N., Sommer, C.: Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 135–146. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  8. 8.
    Klein, P.N.: Preprocessing an undirected planar network to enable fast approximate distance queries. In: SODA, pp. 820–827 (2002)Google Scholar
  9. 9.
    Klein, P.N., Subramanian, S.: A fully dynamic approximation scheme for shortest paths in planar graphs. Algorithmica 22(3), 235–249 (1998)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Mitchell, J.S.B., Papadimitriou, C.H.: The weighted region problem: finding shortest paths through a weighted planar subdivision. J. ACM 38, 18–73 (1991)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Mozes, S., Sommer, C.: Exact distance oracles for planar graphs. CoRR abs/1011.5549 (2010)Google Scholar
  12. 12.
    Sun, Z., Reif, J.H.: On finding approximate optimal paths in weighted regions. J. Algorithms 58(1), 1–32 (2006)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. J. ACM 51(6), 993–1024 (2004)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52(1), 1–24 (2005)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Hristo N. Djidjev
    • 1
  • Christian Sommer
    • 2
  1. 1.Los Alamos National LaboratoryLos Alamos
  2. 2.Massachusetts Institute of TechnologyCambridge

Personalised recommendations