Universal Point Sets for Planar Graph Drawing with Circular Arcs - Archive ouverte HAL Access content directly
Journal Articles Journal of Graph Algorithms and Applications Year : 2014

Universal Point Sets for Planar Graph Drawing with Circular Arcs

(1) , (2) , (3) , (4) , (5) , (6) , (7) , (8)
1
2
3
4
5
6
7
8

Abstract

We prove that there exists a set S of n points in the plane such that every n-vertex planar graph G admits a plane drawing in which every vertex of G is placed on a distinct point of S and every edge of G is drawn as a circular arc.
Fichier principal
Vignette du fichier
Angelini_2014.18.3-1.pdf (233.13 Ko) Télécharger le fichier
Vignette du fichier
topological_book_embedding2.png (14.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Loading...

Dates and versions

hal-00997207 , version 1 (27-05-2014)

Identifiers

Cite

Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, et al.. Universal Point Sets for Planar Graph Drawing with Circular Arcs. Journal of Graph Algorithms and Applications, 2014, 18 (3), pp.313-324. ⟨10.7155/jgaa.00324⟩. ⟨hal-00997207⟩
434 View
196 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More