102 search results - page 4 / 21 » Geometric properties of Assur graphs |
CCCG
2009
14 years 10 months ago
2009
We study a new family of geometric graphs that interpolate between the Delaunay triangulation and the Gabriel graph. These graphs share many properties with skeletons for [0, 1]...
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...
MOBIHOC
2001
ACM
15 years 9 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
GD
2004
Springer
15 years 2 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
95
Voted
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...