Lombardi Drawings of Knots and Links
Publication date
2018-01-21
Authors
Kindermann, Philipp
Kobourov, Stephen
Löffler, Maarten
Nöllenburg, Martin
Schulz, André
Thurston, Dylan
Vogtenhuber, Birgit
Editors
Frati, Fabrizio
Ma, Kwan-Liu
Advisors
Supervisors
Document Type
Part of book
Metadata
Show full item recordCollections
License
Abstract
In Lombardi drawings of graphs, edges are represented as circular arcs and the edges incident on vertices have perfect angular resolution. However, not every graph has a Lombardi drawing and not every planar graph has a planar Lombardi drawing. We introduce k-Lombardi drawings, in which each edge may be drawn with k circular arcs; we show that every graph has a smooth 2-Lombardi drawing and every planar graph has a smooth planar 3-Lombardi drawing. We also investigate related topics connecting planarity and Lombardi drawings.
Keywords
CG, GRAPH, GD
Citation
Kindermann, P, Kobourov, S, Löffler, M, Nöllenburg, M, Schulz, A, Thurston, D & Vogtenhuber, B 2018, Lombardi Drawings of Knots and Links. in F Frati & K-L Ma (eds), Graph Drawing and Network Visualization : 25th International Symposium, GD 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected Papers. 1 edn, Lecture Notes in Computer Science, vol. 10692, Springer, pp. 113–126. https://doi.org/10.1007/978-3-319-73915-1_10