38 search results - page 8 / 8 » Aspect-ratio Voronoi diagram and its complexity bounds |
SASO
2008
IEEE
13 years 11 months ago
2008
IEEE
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
MOBIHOC
2004
ACM
14 years 4 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...