16 search results - page 1 / 4 » Fully dynamic geometric spanners |
132
Voted
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
121
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We present a streaming algorithm for constructing sparse spanners and show that our algorithm out-performs significantly the state-of-the-art algorithm for this task [20]. Speci...
125
Voted
ESA
2005
Springer
15 years 9 months ago
2005
Springer
We present fully dynamic algorithms for maintaining 3- and 5-spanners of undirected graphs under a sequence of update operations. For unweighted graphs we maintain a 3or 5-spanner...
159
click to vote
COMGEO
1999
ACM
15 years 3 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
152
Voted
JACM
2010
15 years 2 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...