Universal Point Sets for Planar Graph Drawing 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 :
Journal articles
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download


https://hal.inria.fr/hal-00997207
Contributor : Monique Teillaud <>
Submitted on : Tuesday, May 27, 2014 - 4:30:00 PM
Last modification on : Thursday, October 10, 2019 - 10:34:04 AM
Long-term archiving on : Wednesday, August 27, 2014 - 12:00:33 PM

Files

Angelini_2014.18.3-1.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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, Brown University, 2014, 18 (3), pp.313-324. ⟨10.7155/jgaa.00324⟩. ⟨hal-00997207⟩

Share

Metrics

Record views

865

Files downloads

297