Abstract
Given a set of points in the plane, we show that the -graph with 5 cones is a geometric spanner with spanning ratio at most . This is the first constant upper bound on the spanning ratio of this graph. The upper bound uses a constructive argument that gives a (possibly self-intersecting) path between any two vertices, of length at most times the Euclidean distance between the vertices. We also give a lower bound on the spanning ratio of .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.