Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10327351 | Computational Geometry | 2015 | 12 Pages |
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 50+225â9.960. 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 50+225 times the Euclidean distance between the vertices. We also give a lower bound on the spanning ratio of 12(115â17)â3.798.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot,