In many areas of computer science- robotics, computer graphics, virtual reality, and geographic information systems are some examples- it is necessary to store, analyse, and create or manipulate spatial data. This course deals with the algorithmic aspects of these tasks: we study techniques and concepts needed for the design and analysis of geometric algorithms and data structures. Each technique and concept will be illustrated on the basis of a problem arising in one of the application areas mentioned above.
Unit details and rules
| Academic unit | Computer Science |
|---|---|
| Credit points | 6 |
| Prerequisites
?
|
None |
| Corequisites
?
|
None |
|
Prohibitions
?
|
COMP4445 |
| Assumed knowledge
?
|
Experience with data structures and algorithms as covered in COMP9003 or COMP9103 or COMP9123 or COMP2123 or COMP2823 or INFO1105 or INFO1905 (or equivalent UoS from different institutions) |
| Available to study abroad and exchange students | Yes |
Teaching staff
| Coordinator | Andre van Renssen, andre.vanrenssen@sydney.edu.au |
|---|---|
| Lecturer(s) | Andre van Renssen, andre.vanrenssen@sydney.edu.au |