Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
- First Online:
- Cite this article as:
- Everett, H., Lazard, S., Liotta, G. et al. Discrete Comput Geom (2010) 43: 272. doi:10.1007/s00454-009-9149-3
- 69 Views
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.