A geometric spanner is a weighted graph on points in Euclidean space, with edge weights equal to their Euclidean distances, in which every pair has a graph path of length at most times its direct distance. Its stretch factor is the largest ratio , where is shortest-path distance. A square's four perimeter edges, without diagonals, give stretch factor : adjacent points have ratio one, and diagonal pairs have route length instead of . The aim is to retain short routes with fewer edges than a complete graph. [ref].

There are no discussions about this article yet.

Articles by others on the same topic (NaN)

There are currently no matching articles.