Geometric Spanner of Segments
نویسندگان
چکیده
Geometric spanner is a fundamental structure in computational geometry and plays an important role in many geometric networks design applications. In this paper, we consider a generalization of the classical geometric spanner problem (called segment spanner): Given a set S of disjoint 2-D segments, find a spanning network G with minimum size so that for any pair of points in S, there exists a path in G with length no more than t times their Euclidean distance. Based on a number of interesting techniques (such as weakly dominating set, strongly dominating set, and interval cover), we present an efficient algorithm to construct the segment spanner. Our approach first identifies a set of Steiner points in S and then construct a point spanner for the set of Steiner points. Our algorithm runs in O(|Q|+n log n) time, where Q is the set of Steiner points. We show that Q is an O(1)-approxiamtion in terms of its size when S is relatively “well” separated by a constant. For arbitrary rectilinear segments and under L1 distance, the approximation ratio improves to 2.
منابع مشابه
Improved Local Algorithms for Spanner Construction
Let S be a set of n points in the plane, let E be the complete Euclidean graph whose point-set is S, and let G be the Delaunay triangulation of S. We present a very simple local algorithm that, given G, constructs a subgraph of G of degree at most 11 that is a geometric spanner of G with stretch factor 2.86, and hence a geometric spanner of E with stretch factor < 7. This algorithm gives an O(n...
متن کاملThe well-separated pair decomposition for balls
Given a real number t > 1, a geometric t-spanner is a geometric graph for a point set in R with straight lines between vertices such that the ratio of the shortest-path distance between every pair of vertices in the graph (with Euclidean edge lengths) to their actual Euclidean distance is at most t. An imprecise point set is modeled by a set R of regions in R. If one chooses a point in each reg...
متن کاملOn Geometric Spanners of Euclidean Graphs and their Applications in Wireless Networks
We consider the problem of constructing a bounded-degree planar geometric spanner for a unit disk graph modeling a wireless network. The related problem of constructing a planar geometric spanner of a Euclidean graph has been extensively studied in the literature. It is well known that the Delaunay subgraph is a planar geometric spanner with stretch factor ; however, its degree may not be bound...
متن کاملOn Spanners of Geometric Graphs
Given a connected geometric graph G, we consider the problem of constructing a t-spanner of G having the minimum number of edges. We prove that for every t with 1 < t < 1 4 log n, there exists a connected geometric graph G with n vertices, such that every t-spanner of G contains Ω(n1+1/t) edges. This bound almost matches the known upper bound, which states that every connected weighted graph wi...
متن کاملStable Roommates Spanner
We introduce a new geometric spanner whose construction is based on a generalization of the known Stable Roommates problem. The Stable Roommates Spanner combines the most desirable properties of geometric spanners: a natural definition, small degree, linear number of edges, strong (1 + ε)-spanner for every > 0, and an efficient construction algorithm. It is an improvement over the well-known Ya...
متن کامل