ABSTRACT
In the current chapter, we consider geometric networks and two important quality measures of such networks; namely, dilation and detour. A geometric network is an undirected graph the vertices of which are points in d-dimensional space, and the edges are straight-line segments connecting the vertices. The sites are usually located in the Euclidean plane, but other metrics and higher dimensions are also common. Geometric networks arise in many applications. Road networks, railway networks, telecommunication, pattern matching, bioinformatics—any collection of objects in space that have some connections between them can be modeled as a geometric network.
