Sciweavers

470 search results - page 1 / 94
» Local properties of geometric graphs
Sort
View
CCCG
2004
13 years 6 months ago
Local properties of geometric graphs
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
Jean Cardinal, Sébastien Collette, Stefan L...
CCCG
2009
13 years 6 months ago
Relaxed Gabriel Graphs
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]...
Prosenjit Bose, Jean Cardinal, Sébastien Co...
ICDCS
2002
IEEE
13 years 9 months ago
Geometric Spanners for Wireless Ad Hoc Networks
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
Yu Wang 0003, Xiang-Yang Li
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 5 months ago
Naming Games in Spatially-Embedded Random Networks
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
Qiming Lu, Gyorgy Korniss, Boleslaw K. Szymanski
IM
2008
13 years 4 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
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...
Chen Avin