Universal Point Sets for Planar Graph Drawings with Circular Arcs - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Universal Point Sets for Planar Graph Drawings 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
Hal.pdf (332.51 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-00846953 , version 1 (22-07-2013)

Identifiers

  • HAL Id : hal-00846953 , version 1

Cite

Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, et al.. Universal Point Sets for Planar Graph Drawings with Circular Arcs. Canadian Conference on Computational Geometry, Aug 2013, Waterloo, Canada. pp.117-122. ⟨hal-00846953⟩
547 View
222 Download

Share

Gmail Facebook Twitter LinkedIn More