Universal Sets of n Points for One-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.
Domains
Computational Geometry [cs.CG]
Fichier principal
universal-revised.pdf (139 Ko)
Télécharger le fichier
2010 Universal Sets for One-bend Drawings.png (19.41 Ko)
Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Loading...