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.
Type de document :
Article dans une revue
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
Contributeur : Sylvain Lazard <>
Soumis le : vendredi 13 novembre 2009 - 09:41:24
Dernière modification le : mardi 25 octobre 2016 - 16:58:38
Document(s) archivé(s) le : jeudi 17 juin 2010 - 20:16:05

Fichier

universal-revised.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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>

Exporter

Partager

Métriques

Consultations de
la notice

307

Téléchargements du document

286