Universal Point Sets for Planar Graph Drawings with Circular Arcs

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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download


https://hal.inria.fr/hal-00846953
Contributor : Monique Teillaud <>
Submitted on : Monday, July 22, 2013 - 12:04:20 PM
Last modification on : Tuesday, December 18, 2018 - 4:18:26 PM
Document(s) archivé(s) le : Wednesday, April 5, 2017 - 3:53:09 PM

Files

Hal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00846953, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

847

Files downloads

362