Sciweavers

Share
DCG
2010

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

10 years 1 months ago
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
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.
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2010
Where DCG
Authors Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath
Comments (0)
books