Linear-size Universal Point Sets for One-bend Drawings
Publication date
2015
Authors
Löffler, Maarten
Tóth, Csaba
Editors
Di Giacomo, E.
Lubiw, A.
Advisors
Supervisors
Document Type
Part of book
Metadata
Show full item recordCollections
License
taverne
Abstract
For every integer $n ge 4$, we construct a planar point set $S_n$ of size $6n-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
CG, GRAPH, GD, Taverne
Citation
Löffler, M & Tóth, C 2015, Linear-size Universal Point Sets for One-bend Drawings. in E Di Giacomo & A Lubiw (eds), Graph Drawing and Network Visualization : 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers. Lecture Notes in Computer Science, vol. 9411, Springer, pp. 423-429. https://doi.org/10.1007/978-3-319-27261-0_35