50 search results - page 8 / 10 » Spanners for Geometric Intersection Graphs |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mec...
DCG
2007
13 years 6 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
WADS
2009
Springer
14 years 26 days ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
ICIP
2003
IEEE
14 years 7 months ago
2003
IEEE
This article addresses the problem of road extraction from new high resolution satellite images. The proposed algorithm is divided in two sequential modules : a topologically corr...
FOCS
2006
IEEE
14 years 9 days ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...