Reference no: EM133244581
Information Visualization
Homework: Graph Drawing
An undirected graph is described in the adjacency matrix below.
|
1
|
2
|
3
|
4
|
5
|
6
|
7
|
8
|
9
|
10
|
1
|
0
|
0
|
1
|
0
|
1
|
0
|
0
|
0
|
1
|
0
|
2
|
0
|
0
|
0
|
0
|
1
|
0
|
1
|
0
|
1
|
0
|
3
|
1
|
0
|
0
|
0
|
0
|
0
|
1
|
1
|
0
|
1
|
4
|
0
|
0
|
0
|
0
|
0
|
1
|
1
|
0
|
1
|
0
|
5
|
1
|
1
|
0
|
0
|
0
|
1
|
0
|
1
|
0
|
0
|
6
|
0
|
0
|
0
|
1
|
1
|
0
|
0
|
0
|
0
|
1
|
7
|
0
|
1
|
1
|
1
|
0
|
0
|
0
|
0
|
0
|
0
|
8
|
0
|
0
|
1
|
0
|
1
|
0
|
0
|
0
|
0
|
1
|
9
|
1
|
1
|
0
|
1
|
0
|
0
|
0
|
0
|
0
|
0
|
10
|
0
|
0
|
1
|
0
|
0
|
1
|
0
|
1
|
0
|
0
|
Without the help of any automated graph layout tool, design a node-link visualization for the graph that shows the node number (1 through 10) and the connections between nodes. Note that a general drawing program such as Paint or PowerPoint could be used as long as it is not meant to automatically position the nodes and automatically route the edges of graphs. Neat hand drawing could also work.
Most importantly, try to make the graph conform to the goals stated in class (see "Goals for graph drawing" slide: reduce intersection, reduce length variations, and reduce bends). It may be impossible to satisfy all goals equally. Optionally, try to design interesting graph representations and try to find interesting patterns to show.
Submit: the graph visualization - must have nodes and links, and one optional paragraph outlining your strategy for depicting the graph.
Peer-review: also remember to review other student's work. A zero should be given if not all nodes and links are included or incorrect edges appear in the graph (10 point deduction otherwise; 20 points for multiple occurrences). The criteria should consider first the three goals for graph drawing. The peer-review criteria are listed below.
Criteria
Please give marks to your peers' assignments. The following is the criteria:
• 0 for missing homework: write the word "missing" in the feedback box for each grade of 0.
• 0 for either missing or incorrect nodes and edges: write the words "incorrect graph" in the feedback for each grade given this way. Also, explain what is incorrect.
• 0 for not having nodes and links between them: write the words "not a node-link" in the feedback for each grade given this way.
• 1 point for graphs that appear random or with many unnecessary graph goal drawing violations: write "random" in feedback.
• 2 points for graphs that have multiple violations of the drawing goals: write "average" in feedback.
• 3 points for graphs that largely conform to the drawing goals, but have one intersection, or unusual long/short links, or one bent links: write "almost all goals" in feedback.
• 4 points for graph that conform to all three graph drawing goals for graphs: write the words "all goals" in the feedback.