• Corpus ID: 7950253

# Towards Tight Bounds on Theta-Graphs

@article{Bose2014TowardsTB,
title={Towards Tight Bounds on Theta-Graphs},
author={Prosenjit Bose and Jean-Lou De Carufel and Pat Morin and Andr{\'e} van Renssen and Sander Verdonschot},
journal={ArXiv},
year={2014},
volume={abs/1404.6233}
}
• Published 24 April 2014
• Mathematics
• ArXiv
We present improved upper and lower bounds on the spanning ratio of $\theta$-graphs with at least six cones. Given a set of points in the plane, a $\theta$-graph partitions the plane around each vertex into $m$ disjoint cones, each having aperture $\theta=2\pi/m$, and adds an edge to the `closest' vertex in each cone. We show that for any integer $k \geq 1$, $\theta$-graphs with $4k+2$ cones have a spanning ratio of $1+2\sin(\theta/2)$ and we provide a matching lower bound, showing that this…
3 Citations

## Figures and Tables from this paper

Spanning Properties of Theta-Theta Graphs
• Mathematics
COCOA
• 2014
It is shown that the spanning ratio of Theta-Theta graphs decreases to $$4.64$$ as $$k'$$ increases to $$8$$, and these are the first results on the spanning properties of TheTA- theta graphs.
Kinetic $k$-Semi-Yao Graph and its Applications
• Computer Science, Mathematics
Comput. Geom.
• 2019
On the performance of greedy forwarding on Yao and Theta graphs
• Computer Science
J. Parallel Distributed Comput.
• 2018

## References

SHOWING 1-10 OF 11 REFERENCES
Competitive routing in the half-θ6-graph
• Computer Science
SODA
• 2012
We present a deterministic local routing scheme that is guaranteed to find a path between any pair of vertices in a half-θ6-graph whose length is at most 5/√3 = 2.886... times the Euclidean distance
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
• Mathematics
WG
• 2010
The main contribution is to show that these graphs are exactly the TD-Delaunay graphs, and are strongly connected to the geodesic embeddings of orthogonal surfaces of coplanar points in the 3D Euclidean space.
Geometric spanner networks
• Computer Science
• 2007
This paper presents a model for designing approximation algorithms with spanners based on the algebraic computation-tree model and some examples show how this model can be applied to well-separated pair decomposition.
Approximation algorithms for shortest path motion planning
This paper gives approximation algorithms of solving the following motion planning problem: Given a set of polyhedral obstacles and points s and t, find a shortest path from s to t that avoids the
A
• van Renssen, S. Verdonschot, Competitive 706 routing in the half-θ6-graph, in: Proceedings of the 23rd ACM-SIAM 707 Symposium on Discrete Algorithms
• 2012
Approximating the d-dimensional complete Eu- 715 clidean graph
• in: Proceedings of the 3rd Canadian Conference on Com- 716 putational Geometry
• 1991
Approximating the d-dimensional complete Euclidean graph
• In Proceedings of the 3rd Canadian Conference on Computational Geometry (CCCG
• 1991