| Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices ⋆ (2008) | |||||||||||||||
Abstract | |||||||||||||||
| 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. 1 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||