Universal Point Sets for Drawing Planar Graphs with Circular Arcs
DOI:
https://doi.org/10.7155/jgaa.00324Abstract
We prove that there exists a set S of n points in the plane such that every n-vertex planar graph G admits a planar 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.Downloads
Download data is not yet available.
Downloads
Published
2014-05-01
How to Cite
Angelini, P., Eppstein, D., Frati, F., Kaufmann, M., Lazard, S., Mchedlidze, T., … Wolff, A. (2014). Universal Point Sets for Drawing Planar Graphs with Circular Arcs. Journal of Graph Algorithms and Applications, 18(3), 313–324. https://doi.org/10.7155/jgaa.00324
License
Copyright (c) 2014 Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff
This work is licensed under a Creative Commons Attribution 4.0 International License.
