research-article

Exact distance oracles for planar graphs

Authors:

Shay Mozes,

Christian SommerAuthors Info & Claims

SODA '12: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms

Pages 209 - 222

Published: 17 January 2012 Publication History

Get Access

Abstract

We present new and improved data structures that answer exact node-to-node distance queries in planar graphs. Such data structures are also known as distance oracles. For any directed planar graph on n nodes with non-negative lengths we obtain the following:

• Given a desired space allocation S ε [n lg lg n, n²], we show how to construct in Õ(S) time a data structure of size O(S) that answers distance queries in Õ(n/√ S) time per query. The best distance oracles for planar graphs until the current work are due to Cabello (SODA 2006), Chen and Xu (STOC 2000), Djidjev (WG 1996), and Fakcharoenphol and Rao (FOCS 2001). For σ ε (1, 4/3) and space S = n^σ, we essentially improve the query time from n²/S to √n²/S.

• As a consequence, we obtain an improvement over the fastest algorithm for k-many distances in planar graphs whenever k ε [√n, n).

• We provide a linear-space exact distance oracle for planar graphs with query time O(n^1/2+ε) for any constant ε > 0. This is the first such data structure with provable sublinear query time.

• For edge lengths ≥ 1, we provide an exact distance oracle of space Õ(n) such that for any pair of nodes at distance l the query time is Õ(min{l, √ n}). Comparable query performance had been observed experimentally but could not be explained theoretically.

Our data structures with superlinear space are based on the following new tool: given a non-self-crossing cycle C with c = O(√n) nodes, we can preprocess G in Õ(n) time to produce a data structure of size O(n lg lg c) that can answer the following queries in Õ(c) time: for a query node u, output the distance from u to all the nodes of C. This data structure builds on and provides an alternative for a related data structure of Klein (SODA 2005), which reports distances to the boundary of a face, rather than a cycle.

References

[1]

{ACC⁺96} Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel H. M. Smid, and Christos D. Zaroliagis. Planar spanners and approximate shortest path queries among obstacles in the plane. In 4th European Symposium on Algorithms (ESA), pages 514--528, 1996.

Abstract

References

Cited By

Index Terms

Recommendations

Exact Distance Oracles for Planar Graphs with Failing Vertices

Almost Optimal Exact Distance Oracles for Planar Graphs

Better tradeoffs for exact distance oracles in planar graphs

Comments

Information

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations