Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings
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.
graph drawing non-planar drawings rac drawings lac drawings