120 search results - page 7 / 24 » On locally Delaunay geometric graphs |
DIALM
2003
ACM
14 years 4 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
ICCCN
2008
IEEE
14 years 5 months ago
2008
IEEE
—Observing that simplicity implies efficiency and scalability, this paper proposes a position-based deployment and routing strategy, and then gives a concrete approach under this...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
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...
ICPR
2010
IEEE
13 years 11 months ago
2010
IEEE
Local invariant feature extraction methods are widely used for image-features matching. There exist a number of approaches aimed at the refinement of the matches between image-fe...
CG
2004
Springer
13 years 10 months ago
2004
Springer
We present a framework for processing point-based surfaces via partial differential equations (PDEs). Our framework efficiently and effectively brings well-known PDE-based process...