Name
Abstract | ||
|---|---|---|
A geometric graph is angle-monotone if every pair of vertices has a path between them that-after some rotation-is x-and y-monotone. Angle-monotone graphs are root 2-spanners and they are increasing-chord graphs. Dehkordi, Frati, and Gudmundsson introduced angle-monotone graphs in 2014 and proved that Gabriel triangulations are angle-monotone graphs. We give a polynomial time algorithm to recognize angle-monotone geometric graphs. We prove that every point set has a plane geometric graph that is generalized angle-monotone-specifically, we prove that the half-theta(6)-graph is generalized angle-monotone. We give a local routing algorithm for Gabriel triangulations that finds a path from any vertex s to any vertex t whose length is within 1+root 2 times the Euclidean distance from s to t. Finally, we prove some lower bounds and limits on local routing algorithms on Gabriel triangulations. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-50106-2_40 | GRAPH DRAWING AND NETWORK VISUALIZATION (GD 2016) |
DocType | Volume | ISSN |
Conference | 9801 | 0302-9743 |
Citations | PageRank | References |
5 | 0.84 | 8 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicolas Bonichon | 1 | 264 | 24.45 |
| Prosenjit K. Bose | 2 | 2336 | 293.75 |
| Paz Carmi | 3 | 321 | 43.14 |
| Irina Kostitsyna | 4 | 33 | 18.08 |
| Anna Lubiw | 5 | 753 | 95.36 |
| Sander Verdonschot | 6 | 110 | 17.98 |