268 research outputs found

    Spanners for Geometric Intersection Graphs

    Full text link
    Efficient algorithms are presented for constructing spanners in geometric intersection graphs. For a unit ball graph in R^k, a (1+\epsilon)-spanner is obtained using efficient partitioning of the space into hypercubes and solving bichromatic closest pair problems. The spanner construction has almost equivalent complexity to the construction of Euclidean minimum spanning trees. The results are extended to arbitrary ball graphs with a sub-quadratic running time. For unit ball graphs, the spanners have a small separator decomposition which can be used to obtain efficient algorithms for approximating proximity problems like diameter and distance queries. The results on compressed quadtrees, geometric graph separators, and diameter approximation might be of independent interest.Comment: 16 pages, 5 figures, Late

    Relaxed spanners for directed disk graphs

    Get PDF
    Let (V,δ)(V,\delta) be a finite metric space, where VV is a set of nn points and δ\delta is a distance function defined for these points. Assume that (V,δ)(V,\delta) has a constant doubling dimension dd and assume that each point pVp\in V has a disk of radius r(p)r(p) around it. The disk graph that corresponds to VV and r()r(\cdot) is a \emph{directed} graph I(V,E,r)I(V,E,r), whose vertices are the points of VV and whose edge set includes a directed edge from pp to qq if δ(p,q)r(p)\delta(p,q)\leq r(p). In \cite{PeRo08} we presented an algorithm for constructing a (1+\eps)-spanner of size O(n/\eps^d \log M), where MM is the maximal radius r(p)r(p). The current paper presents two results. The first shows that the spanner of \cite{PeRo08} is essentially optimal, i.e., for metrics of constant doubling dimension it is not possible to guarantee a spanner whose size is independent of MM. The second result shows that by slightly relaxing the requirements and allowing a small perturbation of the radius assignment, considerably better spanners can be constructed. In particular, we show that if it is allowed to use edges of the disk graph I(V,E,r_{1+\eps}), where r_{1+\eps}(p) = (1+\eps)\cdot r(p) for every pVp\in V, then it is possible to get a (1+\eps)-spanner of size O(n/\eps^d) for I(V,E,r)I(V,E,r). Our algorithm is simple and can be implemented efficiently

    FLOC-SPANNER: An O(1) time, locally self-stabilizing algorithm for geometric spanner construction in a wireless sensor network

    Get PDF
    Geometric spanners are a popular form of topology control in wireless networks because they yield an efficient, reduced interference subgraph for both unicast and broadcast routing.;In this thesis work a distributed algorithm for creation of geometric spanners in a wireless sensor network is presented. Given any connected network, we show that the algorithm terminates in O(1) time, irrespective of network size. Our algorithm uses an underlying clustering algorithm as a foundation for creating spanners, and only relies on the periodic heartbeat messages associated with cluster maintenance for the creation of the spanners. The algorithm is also shown to stabilize locally in the presence of node additions and deletions. The performance of our algorithm is verified using large scale simulations. The average path length ratio for routing along the spanner for large networks is shown to be less than 2.;Geometric Spanners is a well-researched topic. The algorithm presented in this thesis differs from other spanner algorithms in the following ways: 1. It is a distributed locally self-stabilizing algorithm. 2. It does not require location information for its operation. 3. Creates spanner network in constant time irrespective of network size and network density

    Sparse geometric graphs with small dilation

    Get PDF
    Given a set S of n points in R^D, and an integer k such that 0 <= k < n, we show that a geometric graph with vertex set S, at most n - 1 + k edges, maximum degree five, and dilation O(n / (k+1)) can be computed in time O(n log n). For any k, we also construct planar n-point sets for which any geometric graph with n-1+k edges has dilation Omega(n/(k+1)); a slightly weaker statement holds if the points of S are required to be in convex position
    corecore