7 search results - page 1 / 2 » Fast Pruning of Geometric Spanners |
66
Voted
STACS
2005
Springer
15 years 8 months ago
2005
Springer
152
Voted
WADS
2007
Springer
15 years 8 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...
126
Voted
SIAMCOMP
2002
15 years 2 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...
141
Voted
IM
2008
15 years 2 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...
103
click to vote
GRAPHICSINTERFACE
2009
15 years 15 days 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...