Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings

作者：Di Giacomo Emilio^*; Didimo Walter; Liotta Giuseppe; Meijer Henk

来源：Theory of Computing Systems, 2011, 49(3): 565-575.

DOI：10.1007/s00224-010-9275-6

• Graph drawing
• Non-planar drawings
• RAC drawings
• LAC 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.

• 出版日期2011-10