Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices

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.
Fichier principal
Vignette du fichier
GD07_FINAL.pdf (122.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00189036 , version 1 (19-11-2007)

Identifiers

Cite

Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Steve Wismath. Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices. The 15th International Symposium on Graph Drawing - GD 2007, Sep 2007, Sydney, Australia. pp.345-351, ⟨10.1007/978-3-540-77537-9_34⟩. ⟨inria-00189036⟩
179 View
215 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More