Lecture Notes in Computer Science Volume 4875, 2008, pp 345-351

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

Purchase on Springer.com

$29.95 / €24.95 / £19.95*

* Final gross prices may vary according to local VAT.

Get Access

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.