Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings
Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Meijer, Henk (2010) Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 15-20 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_4).
Full text not available from this repository.
In this paper we study non-planar drawings of graphs, and study tradeoffs 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.
Repository Staff Only: item control page