Computational Geometry (COMP5045)

UNIT OF STUDY

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.

Our courses that offer this unit of study

Further unit of study information

Classes

Project Work

Assessment

Through semester assessment (72%) and Final Exam (28%)

Faculty/department permission required?

No

Unit of study rules

Assumed knowledge

Students are assumed to have a basic knowledge of the design and analysis of algorithms and data structures: you should be familiar with big-O notations and simple algorithmic techniques like sorting, binary search, and balanced search trees.

Study this unit outside a degree

Non-award/non-degree study

If you wish to undertake one or more units of study (subjects) for your own interest but not towards a degree, you may enrol in single units as a non-award student.

Cross-institutional study

If you are from another Australian tertiary institution you may be permitted to underake cross-institutional study in one or more units of study at the University of Sydney.