Geometric Spanners With Few Edges and Degree Five


An O(n log n)--time algorithm is presented that, when given a set S of n points in and an integer k with 0 # k # n, computes a graph with vertex set S, that contains at most n - 1 + k edges, has stretch factor O(n/(k+ 1)), and whose degree is at most five. This generalizes a recent result of Aronov et al., who obtained this result for two-dimensional point sets

Similar works

Full text

oaioai:CiteSeerX.psu: time updated on 10/22/2014

This paper was published in CiteSeerX.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.