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 , pp. 345-351(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_34).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-77537-9_34
Classifications: G Algorithms and Complexity > G.210 Bends
URI: http://gdea.informatik.uni-koeln.de/id/eprint/850

Actions (login required)

View Item View Item