On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs

Martin Nöllenburg, Roman Prutkin, Ignaz Rutter

An $st$-path in a drawing of a graph is self-approaching if during the traversal of the corresponding curve from $s$ to any point $t^{\prime }$ on the curve the distance to $t^{\prime }$ is non-incr…