7 search results - page 1 / 2 » Fast Pruning of Geometric Spanners |
STACS
2005
Springer
15 years 3 months ago
2005
Springer
WADS
2007
Springer
15 years 3 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
SIAMCOMP
2002
14 years 9 months ago
2002
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...
102
click to vote
IM
2008
14 years 9 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
GRAPHICSINTERFACE
2009
14 years 7 months ago
2009
Sketch recognition is the automated recognition of hand-drawn diagrams. When allowing users to sketch as they would naturally, users may draw shapes in an interspersed manner, sta...