HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Universal Sets of n Points for 1-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 Dip. di Ingegneria Elettronica e dell'Informazione
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 :
Conference papers
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
https://hal.inria.fr/inria-00189036
Contributor : Sylvain Lazard Connect in order to contact the contributor
Submitted on : Monday, November 19, 2007 - 6:36:51 PM
Last modification on : Thursday, January 20, 2022 - 4:16:33 PM
Long-term archiving on: : Monday, September 24, 2012 - 3:40:37 PM

File

Vignette du document
GD07_FINAL.pdf
Files produced by the author(s)

Identifiers

Collections

CNRS | INRIA | INRIA2 | LORIA | UNIV-LORRAINE

Citation

Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Steve Wismath. Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices. The 15th International Symposium on Graph Drawing - GD 2007, Sep 2007, Sydney, Australia. pp.345-351, ⟨10.1007/978-3-540-77537-9_34⟩. ⟨inria-00189036⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

177

Files downloads

204

 

Contact                    Legal Notice                    Personal Data