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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

topological_book_embedding2.png
topological_book_embedding2.png
https://hal.inria.fr/hal-00846953
Contributor : Monique Teillaud <>
Submitted on : Monday, July 22, 2013 - 12:04:20 PM
Last modification on : Wednesday, August 7, 2019 - 12:14:02 PM
Long-term archiving on : 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

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. ⟨hal-00846953⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

882

Files downloads

380

Contact


archive-ouverte@inria.fr