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
?
|
Enrolment in a thesis unit. INFO4001 or INFO4911 or INFO4991 or INFO4992 or AMME4111 or BMET4111 or CHNG4811 or CIVL4022 or ELEC4712 or COMP4103 or SOFT4103 or DATA4103 or ISYS4103 |
Prohibitions
?
|
COMP5045 |
Assumed knowledge
?
|
Experience with data structures and algorithms as covered in (COMP2123 or COMP2823 or INFO1105 or INFO1905) and (COMP3027 or COMP3927) |
Available to study abroad and exchange students | Yes |
Teaching staff
Coordinator | Andre van Renssen, andre.vanrenssen@sydney.edu.au |
---|