On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
An st-path in a drawing of a graph is self-approaching if during a traversal of the corresponding curve from s to any point t′ on the curve the distance to t′ is non-increasing. A path has increasing chords if it is self-approaching in both directions. A drawing is self-approaching (increasing-chord) if any pair of vertices is connected by a self-approaching (increasing-chord) path.
We study self-approaching and increasing-chord drawings of triangulations and 3-connected planar graphs. We show that in the Euclidean plane, triangulations admit increasing-chord drawings, and for planar 3-trees we can ensure planarity. Moreover, we give a binary cactus that does not admit a self-approaching drawing. Finally, we show that 3-connected planar graphs admit increasing-chord drawings in the hyperbolic plane and characterize the trees that admit such drawings.
Unable to display preview. Download preview PDF.
- 8.Felsner, S.: Geometric Graphs and Arrangements. Vieweg+Teubner Verlag (2004)Google Scholar
- 10.Huang, W., Eades, P., Hong, S.-H.: A graph reading behavior: Geodesic-path tendency. In: IEEE Pacific Visualization Symposium (PacificVis 2009), pp. 137–144 (2009)Google Scholar
- 12.Kleinberg, R.: Geographic routing using hyperbolic space. In: Computer Communications (INFOCOM 2007), pp. 1902–1909. IEEE (2007)Google Scholar
- 15.Nöllenburg, M., Prutkin, R., Rutter, I.: On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. CoRR arXiv:1409.0315 (2014)Google Scholar
- 18.Rao, A., Ratnasamy, S., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without location information. In: Mobile Computing and Networking (MobiCom 2003), pp. 96–108. ACM (2003)Google Scholar
- 20.Schnyder, W.: Embedding planar graphs on the grid. In: Discrete Algorithms (SODA 1990), pp. 138–148. SIAM (1990)Google Scholar