[Paper Review] Towards Tight Bounds on Theta-Graphs

Prosenjit Bose, Jean-Lou De Carufel+3 more|arXiv (Cornell University)|Apr 24, 2014

Computational Geometry and Mesh Generation5 references4 citations

TL;DR

This paper establishes tight spanning ratio bounds for θ-graphs with at least six cones, proving that θ_{4k+2}-graphs have a spanning ratio of exactly 1 + 2sin(θ/2), while providing improved upper and lower bounds for θ_{4k+3}, θ_{4k+4}, and θ_{4k+5}-graphs. The results resolve long-standing gaps in understanding geometric spanner efficiency and reveal that increasing cone count can worsen spanning performance.

ABSTRACT

We present improved upper and lower bounds on the spanning ratio of $θ$-graphs with at least six cones. Given a set of points in the plane, a $θ$-graph partitions the plane around each vertex into $m$ disjoint cones, each having aperture $θ=2π/m$, and adds an edge to the `closest' vertex in each cone. We show that for any integer $k \geq 1$, $θ$-graphs with $4k+2$ cones have a spanning ratio of $1+2\sin(θ/2)$ and we provide a matching lower bound, showing that this spanning ratio tight. Next, we show that for any integer $k \geq 1$, $θ$-graphs with $4k+4$ cones have spanning ratio at most $1+2\sin(θ/2)/(\cos(θ/2)-\sin(θ/2))$. We also show that $θ$-graphs with $4k+3$ and $4k+5$ cones have spanning ratio at most $\cos(θ/4)/(\cos(θ/2)-\sin(3θ/4))$. This is a significant improvement on all families of $θ$-graphs for which exact bounds are not known. For example, the spanning ratio of the $θ$-graph with 7 cones is decreased from at most 7.5625 to at most 3.5132. These spanning proofs also imply improved upper bounds on the competitiveness of the $θ$-routing algorithm. In particular, we show that the $θ$-routing algorithm is $(1+2\sin(θ/2)/(\cos(θ/2)-\sin(θ/2)))$-competitive on $θ$-graphs with $4k+4$ cones and that this ratio is tight. Finally, we present improved lower bounds on the spanning ratio of these graphs. Using these bounds, we provide a partial order on these families of $θ$-graphs. In particular, we show that $θ$-graphs with $4k+4$ cones have spanning ratio at least $1+2 an(θ/2)+2 an^2(θ/2)$. This is somewhat surprising since, for equal values of $k$, the spanning ratio of $θ$-graphs with $4k+4$ cones is greater than that of $θ$-graphs with $4k+2$ cones, showing that increasing the number of cones can make the spanning ratio worse.

Motivation & Objective

• To close the gap in spanning ratio bounds for θ-graphs with at least six cones, which had remained unresolved for decades.
• To generalize the spanning proof of the half-θ₆-graph to a broader family of θ-graphs with 4k+2 cones.
• To improve upper and lower bounds on the spanning ratio for θ_{4k+3}, θ_{4k+4}, and θ_{4k+5}-graphs, which previously lacked tight analysis.
• To analyze the competitiveness of the θ-routing algorithm and establish tight bounds on its routing ratio.
• To compare the spanning performance of different θ-graph families and establish a partial order based on spanning ratio.

Proposed method

• Generalizing the inductive spanning proof from the half-θ₆-graph to θ_{4k+2}-graphs using canonical triangles and cone partitioning.
• Applying geometric analysis to derive upper bounds on the spanning ratio for θ_{4k+3}, θ_{4k+4}, and θ_{4k+5}-graphs using trigonometric expressions involving sin(θ/2), cos(θ/2), and tan(θ/2).
• Constructing lower bound examples by placing vertices near corners of canonical triangles to force long routing paths, ensuring the θ-routing algorithm takes paths arbitrarily close to the theoretical worst-case ratio.
• Using recursive vertex placement with auxiliary vertices to maintain cycle integrity and prevent shortcuts, enabling the construction of arbitrarily long routing paths.
• Analyzing the routing path length as a geometric series to derive the routing ratio as 1/(1 - 2sin(θ/2)) for θ_{4k+4}-graphs.
• Establishing a partial order among θ-graph families by comparing their spanning ratio lower bounds, revealing counterintuitive results such as θ_{4k+4}-graphs having worse spanning ratios than θ_{4k+2}-graphs for the same k.

Experimental results

Research questions

• RQ1 What is the exact spanning ratio of θ_{4k+2}-graphs for k ≥ 1?
• RQ2 Can tighter upper and lower bounds be established for θ_{4k+3}, θ_{4k+4}, and θ_{4k+5}-graphs?
• RQ3 What is the competitiveness of the θ-routing algorithm on θ_{4k+4}-graphs, and is this bound tight?
• RQ4 Does increasing the number of cones in a θ-graph always improve its spanning ratio, or can it worsen performance?
• RQ5 Can a partial order be established among different families of θ-graphs based on their spanning ratio properties?

Key findings

• The spanning ratio of θ_{4k+2}-graphs is exactly 1 + 2sin(θ/2), and this bound is tight, marking the first time such a tight bound is established for a large family of θ-graphs beyond the θ₆-graph.
• For θ_{4k+4}-graphs, the spanning ratio is at most 1 + 2sin(θ/2)/(cos(θ/2) - sin(θ/2)), representing a significant improvement over previous upper bounds.
• The spanning ratio of the θ₇-graph is reduced from at most 7.5625 to at most 3.5132 using the new upper bound for θ_{4k+3}-graphs.
• The θ-routing algorithm is (1 + 2sin(θ/2)/(cos(θ/2) - sin(θ/2)))-competitive on θ_{4k+4}-graphs, and this bound is tight.
• A lower bound of 1 + 2tan(θ/2) + 2tan²(θ/2) is established for θ_{4k+4}-graphs, showing that increasing the number of cones can worsen the spanning ratio for equal k values.
• The spanning ratio of θ_{4k+4}-graphs is greater than that of θ_{4k+2}-graphs for the same k, demonstrating that more cones do not always yield better spanners.