1. I NTRODUCTION TO G RAPH DRAWING Fall 2010 Battista, G. D., Eades, P., Tamassia, R., and Tollis, I. G. 1998 Graph Drawing: Algorithms for the Visualization of Graphs. 1st. Prentice Hall PTR.

3. http://www.infovis.info/index.php?words=diagrams

4. http://graphics.stanford.edu/papers/h3cga/html/cga.html#teaserfig

6. W HAT ARE GRAPHS A set of entities, vertices and relationships, edges between those entities. vertices edges

7. T ERMINOLOGY E is a finite multiset of edges or unordered pairs of (u,v) Self-loop Multiple edge Simple graph End vertices Adjacent Incident

8. Degree of vertex Directed edge Digraph Directed edge Indegree, Outdegree Incomming edge Outgoing edge

9. T RANSITIVE R EDUCTION

10. A DJACENCY MATRIX AND A DJACENCY LIST

11. D RAWING OF A GRAPH

12. Connected graph Cutvertex Biconnected graph Block of a graph

13. W E NEED … Graph …. Combinatorial properties Directed Acyclic …

14. P ARAMETERS OF GRAPH DRAWING METHODS Drawing conventions Aesthetics Constraints Efficiency

15. D RAWING CONVENTIONS Polyline drawing Straight-line drawing Orthogonal drawing Grid drawing Planar drawing Upward (downward) drawing (PERT ( Program Evaluation Review Technique)) Drawing conventions Aesthetics Constraints Efficiency

16. A ESTHETICS Crossing edges Area of drawing Total edge length Maximum edge length Uniform edge length Total bend Maximum bend Uniform bend Angular resolution Aspect ratio Symmetry Drawing conventions Aesthetics Constraints Efficiency

17. C ONSTRAINTS Center the given vertex External the given vertex Cluster the given subset of vertices Left-right (top-bottom) Shape (predefined) Drawing conventions Aesthetics Constraints Efficiency

18. P RECEDENCE AMONG AESTHETICS Aesthetics often conflict with each other so some tradeoffs are unavoidable Even if they do not conflict it is algorithmically hard to deal with them at the same time Minimize edge crossingMaximize symmetry

19. APPROACHES The topology-shape-metrics approach Planarization Orthogonalization Compaction The hierarchical approach Layer assignment Crossing reduction X-coordinate assignment The visibility approach Planarization Visibility Replacement The augmentation approach Planarization Augmentation Triangulation drawing The Force-directed approach The divide and conquer approach