# Angle-Monotone Graphs: Construction and Local Routing

A geometric graph in the plane is angle-monotone of width γ if every pair of vertices is connected by an angle-monotone path of width γ, a path such that the angles of any two edges in the path differ by at most γ. Angle-monotone graphs have good spanning properties. We prove that every point set in the plane admits an angle-monotone graph of width 90^∘, hence with spanning ratio √(2), and a subquadratic number of edges. This answers an open question posed by Dehkordi, Frati and Gudmundsson. We show how to construct, for any point set of size n and any angle α, 0 < α < 45^∘, an angle-monotone graph of width (90^∘+α) with O(n/α) edges. Furthermore, we give a local routing algorithm to find angle-monotone paths of width (90^∘+α) in these graphs. The routing ratio, which is the ratio of path length to Euclidean distance, is at most 1/cos(45^∘ + α/2), i.e., ranging from √(2)≈ 1.414 to 2.613. For the special case α = 30^∘, we obtain the Θ_6-graph and our routing algorithm achieves the known routing ratio 2 while finding angle-monotone paths of width 120^∘.

• 24 publications
• 32 publications
research
07/01/2017

### Angle-monotone Paths in Non-obtuse Triangulations

We reprove a result of Dehkordi, Frati, and Gudmundsson: every two verti...
research
06/22/2018

### Uniform 2D-Monotone Minimum Spanning Graphs

A geometric graph G is xy-monotone if each pair of vertices of G is conn...
research
08/03/2018

### On the Spanning and Routing Ratio of Theta-Four

We present a routing algorithm for the Theta-4-graph that computes a pat...
research
05/09/2020

### Realizability of Planar Point Embeddings from Angle Measurements

Localization of a set of nodes is an important and a thoroughly research...
research
02/15/2018

### Finding small-width connected path decompositions in polynomial time

A connected path decomposition of a simple graph G is a path decompositi...
research
10/23/2019

### Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points

Emanation graphs of grade k, introduced by Hamedmohseni, Rahmati, and Mo...
research
01/16/2014

### Theta*: Any-Angle Path Planning on Grids

Grids with blocked and unblocked cells are often used to represent terra...

Please sign up or login with your details

Forgot password? Click here to reset