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.
%0 Journal Article
%1 aefklmtw-upsdp-JGAA14
%A Angelini, Patrizio
%A Eppstein, David
%A Frati, Fabrizio
%A Kaufmann, Michael
%A Lazard, Silvain
%A Mchedlidze, Tamara
%A Teillaud, Monique
%A Wolff, Alexander
%D 2014
%J Journal of Graph Algorithms & Applications
%K circular-arc_drawing construction graph_drawing myown planar_graphs universal_point_sets
%N 3
%P 313--324
%R 10.7155/jgaa.00324
%T Universal Point Sets for Drawing Planar Graphs with
Circular Arcs
%V 18
%X 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.
@article{aefklmtw-upsdp-JGAA14,
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 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.},
added-at = {2024-02-18T09:53:56.000+0100},
author = {Angelini, Patrizio and Eppstein, David and Frati, Fabrizio and Kaufmann, Michael and Lazard, Silvain and Mchedlidze, Tamara and Teillaud, Monique and Wolff, Alexander},
biburl = {https://www.bibsonomy.org/bibtex/2958b9a6aacb441efd6ccb96f611067f6/awolff},
doi = {10.7155/jgaa.00324},
interhash = {fed8d17bc90179ca8a97bfed15908606},
intrahash = {958b9a6aacb441efd6ccb96f611067f6},
journal = {Journal of Graph Algorithms \& Applications},
keywords = {circular-arc_drawing construction graph_drawing myown planar_graphs universal_point_sets},
number = 3,
pages = {313--324},
timestamp = {2024-02-18T12:36:59.000+0100},
title = {Universal Point Sets for Drawing Planar Graphs with
Circular Arcs},
volume = 18,
year = 2014
}