Graph Drawing Criteria minimize crossings, area, bends/curves maximize angular resolution, symmetry most criteria individually NP-hard cannot just compute optimal answer heuristics: try to find something reasonable criteria mutually incompatible [Ware, Purchase, Colpys, and McGill. Cognitive Measures of Graph Aesthetics. Information Visualization 1(2):103-110, Palgrave 2002] [Brandenburg. Nice Drawings of Graphs are Computationally Hard. Visualization in Human-Computer Interaction, Springer Verlag 1988] good bad good bad edge crossing symmetry 2