Discrete & Computational Geometry

, Volume 43, Issue 2, pp 272–288

Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices


  • Hazel Everett
    • INRIA Nancy Grand EstUniversité Nancy 2, LORIA
    • INRIA Nancy Grand EstUniversité Nancy 2, LORIA
  • Giuseppe Liotta
    • Dip. di Ingegneria Elettronica e dell’InformazioneUniversità degli Studi di Perugia
  • Stephen Wismath
    • Department of Mathematics and Computer ScienceUniversity of Lethbridge

DOI: 10.1007/s00454-009-9149-3

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


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.


Graph drawingUniversal point setsOne-bend drawingsSimultaneous embeddings
Download to read the full article text

Copyright information

© Springer Science+Business Media, LLC 2009