Sciweavers

SIAMCOMP
2002
113views more  SIAMCOMP 2002»
14 years 3 days ago
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
Joachim Gudmundsson, Christos Levcopoulos, Giri Na...