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

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.
Document type :
Journal articles
Journal of Discrete and Computational Geometry, Springer, 2010, 43 (2), pp.272-288. <http://www.springerlink.com/content/1851pv541v2714v5/>. <10.1007/s00454-009-9149-3>


https://hal.inria.fr/inria-00431769
Contributor : Sylvain Lazard <>
Submitted on : Friday, November 13, 2009 - 9:41:24 AM
Last modification on : Wednesday, October 7, 2015 - 1:09:03 AM
Document(s) archivé(s) le : Thursday, June 17, 2010 - 8:16:05 PM

File

universal-revised.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Steve Wismath. Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. Journal of Discrete and Computational Geometry, Springer, 2010, 43 (2), pp.272-288. <http://www.springerlink.com/content/1851pv541v2714v5/>. <10.1007/s00454-009-9149-3>. <inria-00431769>

Export

Share

Metrics

Record views

179

Document downloads

262