18 search results - page 1 / 4 » Communication-Efficient Construction of the Plane Localized ... |
72
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4 3 9 -spanner of the unit-disk graph UDG(V ). This algorithm makes only one ...
ASPDAC
2001
ACM
15 years 1 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
116
click to vote
SMA
2009
ACM
15 years 4 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
78
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—We study the problem of localizing a large sensor network having a complex shape, possibly with holes. A major challenge with respect to such networks is to figure out the corr...