# David Eppstein - Publications

##

**Universal point sets for planar graph drawings with circular arcs**.

P. Angelini,
D. Eppstein,
F. Frati,
M. Kaufmann,
S. Lazard,
T. Mchedlidze,
M. Teillaud, and
A. Wolff.

HAL-Inria open archive oai:hal.inria.fr:hal-00846953.

*25th Canadian Conference on Computational Geometry*, Waterloo,
Canada, 2013.

*J. Graph Algorithms
and Applications* 18 (3): 313–324, 2014.
For every positive integer *n*, there exists a set of *n*
points on a parabola, with the property that every *n*-vertex
planar graph can be drawn without crossings with its vertices at these
points and with its edges drawn as circular arcs.

(Slides)

Co-authors –
Publications –
David Eppstein –
Theory Group –
Inf. & Comp. Sci. –
UC Irvine

Semi-automatically filtered
from a common source file.