Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices
Everett, Hazel and Lazard, Sylvain and Liotta, Giuseppe and Wismath, Stephen (2008) Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 345-351 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_34).
Full text not available from this repository.
This paper shows that any planar graph with $n$ vertices can be point-set embedded with at most one bend per edge on a universal set of $n$ points in the plane. An implication of this result is that any number of planar graphs admit a simultaneous embedding without mapping with at most one bend per edge.
Repository Staff Only: item control page