Reference Work Entry

Encyclopedia of Algorithms

pp 40-43

Applications of Geometric Spanner Networks

2002; Gudmundsson, Levcopoulos, Narasimhan, Smid
  • Joachim GudmundssonAffiliated withDMiST, National ICT Australia Ltd
  • , Giri NarasimhanAffiliated withSchool of Computing and Information Science, Florida International University
  • , Michiel SmidAffiliated withSchool of Computer Science, Carleton University

Keywords and Synonyms

Stretch factor      

Problem Definition

Given a geometric graph in d-dimensional space, it is useful to preprocess it so that distance queries, exact or approximate, can be answered efficiently. Algorithms that can report distance queries in constant time are also referred to as “distance oracles”. With unlimited preprocessing time and space, it is clear that exact distance oracles can be easily designed. This entry sheds light on the design of approximate distance oracles with limited preprocessing time and space for the family of geometric graphs with constant dilation.

Notation and Definitions

If p and q are points in ℝd, then the notation |pq| is used to denote the Euclidean distance between p and q; the notation \( \delta_G(p,q) \) is used to denote the Euclidean length of a shortest path between p and q in a geometric network G. Given a constant ...

This is an excerpt from the content