| Due November 6 | CS 4460 - Information Visualization | Fall 2017 |
The purpose of this assignment is to give you an appreciation of just how challenging it is to lay out a graph (network) in the plane. Below is an adjacency matrix for an undirected graph. Your objective here is to come up with a positioning for all the vertices such that an aesthetically pleasing graph drawing results. Please draw the graph using a standard technique: vertices are represented by some kind of glyph such as a circle, square, etc. with the vertex number inside. Edges are simply lines draw between vertices. Follow those basics, then you are free to embellish beyond that.
You should turn in one piece of paper: one side will contain your graph drawing (draw it using the entire side of an 8.5" X 11" piece of paper) and the other side should contain a paragraph or two describing your design process and the method or algorithm you used to create the graph. Put your name on the page with your description of your method, not on the drawing page. NOTE: You only need to bring in one copy of your work this time. Please arrive on-time for the class when you turn it in.
This is just a short HW, so don't spend too much time or thought on it. (It turns out that you could spend the rest of your life on it.) Just come up with something reasonable and we'll run a contest in class to see whose design is most liked. If you follow the instructions, you'll receive full credit. (The people who do the best job may receive extra credit.)
NOTE:No late turn-ins will be accepted for this assignment.
1 2 3 4 5 6 7 8 9 10
---------------------------------------
|
1 | 0 0 1 0 0 1 1 0 0 0
|
2 | 0 0 1 0 0 1 0 1 1 0
|
3 | 1 1 0 0 0 0 0 0 0 1
|
4 | 0 0 0 0 1 0 1 0 1 0
|
5 | 0 0 0 1 0 0 0 1 0 0
|
6 | 1 1 0 0 0 0 0 0 1 1
|
7 | 1 0 0 1 0 0 0 1 0 0
|
8 | 0 1 0 0 1 0 1 0 0 0
|
9 | 0 1 0 1 0 1 0 0 0 0
|
10 | 0 0 1 0 0 1 0 0 0 0
|