Q1. (a) Briefly introduce how Force-directed algorithms encode networks. (5 points)
(b) In force-directed placement, does spatial proximity (visual clump) always indicate grouping/ community? Explain. (5 points)
(c) One of the weakness of force-directed placement is that the layouts are often nondeterministic. What does it mean? (5 points)
(d) Illustrate the scalability issue of force-directed placement briefly. (5 points)
Q2. (a) How does adjacency matrix encode networks? (5 points)
(b) Give an example of matrix view of a network that’s not from the textbook and explain what it is. You need to include the reference if the answer is found online. (5 points)
Q3. (a) How does tree maps encode trees? (5 points)
(b) Given an example of Tree map layout that’s not from the textbook and explain what it is. You need to include the reference if the answer is found online. (5 points)
Map Color and Other Channels
Q4. Color can be best understood in terms of three separate channels: luminance, hue, and saturation. Briefly explain how this system specifies colors. (Figures can be used to help illustration.) (5 points)
Q5. Explain the meaning of HSL /HSV and how does this system specify colors? (5 points)
Q6. (a) What are three major problems with the common continuous rainbow colormap? (6 points)
(b) Is there any way to address these three problems? Explain how. (4 points)
