## Linear-size Universal Point Sets for One-bend Drawings

For every integer *n* ≥ 4, we construct a planar point set *S*_{n} of size 6*n* − 10 such that every *n*-vertex planar graph *G* admits a plane embedding in which the vertices are mapped to points in *S*_{n}, and every edge is either a line segment or a polyline with one bend, where the bend point is also in *S*_{n}.

keywords: Computational Geometry, Graph Drawing, Graphs Theory

### Conference Proceedings (peer-reviewed)

Csaba Tóth, Maarten Löffler

Linear-size Universal Point Sets for One-bend Drawings

Proc. 23rd International Symposium on Graph Drawing

LNCS 9411, 423–429, 2015

back to list