Skip to Main content Skip to Navigation
Journal articles

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

Hazel Everett 1 Sylvain Lazard 1 Giuseppe Liotta 2 Steve Wismath 3
1 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 School of Computing
3 Department of Mathematics and Computer Science
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
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

2010 Universal Sets for One-bend Drawings.png
2010 Universal Sets for One-bend Drawings.png
https://hal.inria.fr/inria-00431769
Contributor : Sylvain Lazard <>
Submitted on : Friday, November 13, 2009 - 9:41:24 AM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM

Files

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

Identifiers

Collections

CNRS | INRIA | UNIV-LORRAINE | LORIA

Citation

Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Steve Wismath. Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. Discrete and Computational Geometry, Springer Verlag, 2010, 43 (2), pp.272-288. ⟨10.1007/s00454-009-9149-3⟩. ⟨inria-00431769⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

707

Files downloads

562