We give a new local test, called a Half-Space Proximal or HSP test, for extracting a sparse directed or undirected subgraph of a given unit disk graph. The HSP neighbors of each vertex are unique, given a fixed underlying unit disk graph. The HSP test is a fully distributed, computationally simple algorithm that is applied independently to each vertex of a unit disk graph. The directed spanner obtained by this test is shown to be strongly connected, has out-degree at most six, its dilation is at most 2π + 1, contains the minimum weight spanning tree as its subgraph and, unlike the Yao graph, it is rotation invariant. Since no coordinate assumption is needed to determine the HSP nodes, the test can be applied in any metric space.

Additional Metadata
Persistent URL dx.doi.org/10.1007/11795490_19
Chavez, E. (Edgar), Dobrev, S. (Stefan), Kranakis, E, Opatrny, J. (Jaroslav), Stacho, L. (Ladislav), Tejeda, H. (Héctor), & Urnitia, J. (Jorge). (2006). Half-space proximal: A new local test for extracting a bounded dilation spanner of a unit disk graph. doi:10.1007/11795490_19