Universal Point Sets for Planar Graph Drawings with Circular Arcs

Patrizio Angelini 1 David Eppstein 2 Fabrizio Frati 3 Michael Kaufmann 4 Sylvain Lazard 5 Tamara Mchedlidze 6 Monique Teillaud 7 Alexander Wolff 8
1 Dipartimento di Ingegneria [Roma]
2 Department of computer science [Irvine]
3 IT - School of Information Technologies [Sydney]
4 Wilhelm-Schickard-Institut für Informatik [Tübingen]
5 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
6 Institute of Theoretical Informatics
7 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
8 Lehrstuhl für Informatik I [Würzburg]
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.
Type de document :
Communication dans un congrès
Canadian Conference on Computational Geometry, Aug 2013, Waterloo, Canada. pp.117-122, 2013
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

topological_book_embedding2.png
topological_book_embedding2.png
https://hal.inria.fr/hal-00846953
Contributeur : Monique Teillaud <>
Soumis le : lundi 22 juillet 2013 - 12:04:20
Dernière modification le : mercredi 10 octobre 2018 - 20:44:13
Document(s) archivé(s) le : mercredi 5 avril 2017 - 15:53:09

Fichiers

Hal.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00846953, version 1

Collections

INRIA | UNIV-LORRAINE | LORIA-ALGO | LORIA

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, 2013. 〈hal-00846953〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

706

Téléchargements de fichiers

356

Contact


archive-ouverte@inria.fr