Abstract
In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area. © 2010 Springer-Verlag.
Cite
CITATION STYLE
APA
Di Giacomo, E., Didimo, W., Liotta, G., & Meijer, H. (2010). Area, curve complexity, and crossing resolution of non-planar graph drawings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5849 LNCS, pp. 15–20). https://doi.org/10.1007/978-3-642-11805-0_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free