Abstract

Let G be a geometric t-spanner in Ed with n vertices and m edges, where t is a constant. We show that G can be preprocessed in O(m log n) time, such that (1 + ?)-approximate shortest-path queries in G can be answered in O(1) time. The data structure uses O(n log n) space.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call