Learn More
Euclidean spanners are important data structures in geometric algorithm design, because they provide a means of approximating the complete Eu-clidean graph with only O(n) edges, so that the shortest path length between each pair of points is not more than a constant factor longer than the Euclidean distance between the points. In many applications of(More)
Given a set S of n points in the plane, we give an O(n log n)-time algorithm that constructs a plane t-spanner for S, with t ≈ 10, such that the degree of each point of S is bounded from above by 27, and the total edge length is proportional to the weight of a minimum spanning tree of S. Previously, no algorithms were known for constructing plane t-spanners(More)
Given a triangulation G, whose vertex set V is a set of n points in the plane, and given a real number γ with 0 < γ < π, we design an O(n)-time algorithm that constructs a connected spanning subgraph G of G whose maximum degree is at most 14 + 2π/γ. If G is the Delaunay triangulation of V , and γ = 2π/3, we show that G is a t-spanner of V (for some constant(More)
We consider the problem of finding an obstacle-avoiding path between two points s and t in the plane, amidst a set of disjoint polyg-onal obstacles with a total of n vertices. The length of this path should be within a small constant factor c of the length of the shortest possible obstacle-avoiding s-t path measured in the Lv-metric. Such an approximate(More)
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in R d. t-spanners are Euclidean graphs in which distances between vertices in G are at most t times the Euclidean distances between them; in other words, distances in G are " stretched " by a factor of at most t. We consider(More)