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

@inproceedings{Everett2007UniversalSO,
title={Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices},
author={Hazel Everett and Sylvain Lazard and Giuseppe Liotta and Stephen K. Wismath},
booktitle={Graph Drawing},
year={2007}
}

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.