COMP5048 Information Visualization

! DON’T FORGET !:

· Come to class on Thursday Oct 28 to hear all about the sample exam!!!

· Sample exam: a beta-version of a sample exam is now available. Please do some questions then come to me for feedback.

· Peter will be away from November 1 to November 20. Please make an appointment to see me before the end of this week!

· Exam is on November 15.

!NEW!:

· Marks from ALL assignments.

Semester 2, 2010

Outline

This unit covers algorithms to make good pictures of abstract information, such as stock prices, family trees, and software design diagrams.

Assumed Knowledge

You need to have

· Basic knowledge of algorithms and data structures

· Basic mathematical skills, especially geometry

· Basic programming skills, in any language

It helps if you

· Have studied Algorithms, especially Computational Geometry

· Can write programs using graphics

· Are comfortable with spatial design problems

Learning outcomes

Basic concepts and algorithms to produce good visualizations of abstract data effectively and efficiently:

· Understanding visualization methods

· Using geometric algorithms for visualization

· Applying visualization methods

Coordinator
Peter Eades

Consultation time: Thursdays 5pm – 6pm, or by appointment
peter.eades (at) sydney.edu.au

Level 3, School of Information Technologies Building, J12

Class times and places
Lectures: School of Information Technologies Laboratory 114

Assessment overview

	Marks	Deadline	General aim	Files
Assignment 1	10%	3pm on Thursday September 2	Make some pictures of some data.	Html version Pdf version Graph Drawing contest a1q2a.txt a1q2b.txt (see note about data) a1q3.pdf a1q4a.txt a1q4b.txt a1q4c.txt MARKS
Assignment 2	10%	Week 10	Make a computer system that makes pictures of some data	a2.pdf
Assignment 3	5%	Weeks 11, 12, 13	Give a talk	As3.pdf Schedule of papers Suggested talk outline
Exam	75%	Exam period

Assessment note

Please read the School of IT Assessment Policy and the University Policy Student Plagiarism: Coursework – Policy and Procedure, and submit the appropriate cover sheet with your signature with each hardcopy submission. The cover sheets are available from the School of IT link above.

Schedule

This schedule is subject to change.

Week	Date	Topic
1	July 29	Introduction to InfoVis.	Homework1
2	Aug 5	Drawing trees.	As1 Reingold - Tilford
3	Aug 12	HV tree drawing. Graphs and planar graphs.	Notes on HVtree Pictures pdf Pictures pptx Homework2 References
4	Aug 19	Force directed and MDS methods; catchup	As2 handout
	Aug 20	The Anatomy of a Graph Visualization System
5	Aug 26	Force directed and Layered graph drawing (Click here for a pdf that includes this lecture, as well as some other stuff)
6	Sept 2	Network analysis and visualization	As1 handin
7	Sept 9	Planar graph drawing	As3 handout
8	Sept 16	Evaluation
9	Sept 23	Multi-attribute visualization: notes1, notes2, and notes3
	Sept 30	Break
10	Oct 7	Student presentations As3.pdf Schedule of papers Suggested talk outline	As2 handin
11	Oct 14
12	Oct 21
13	Oct 28	Summary and sample exam