Useful links
Unit of study_
COMP5045: Computational Geometry
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.
| Code | COMP5045 |
|---|---|
| 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) |
At the completion of this unit, you should be able to:
- LO1. Argue the correctness and efficiency of a proposed solution. Mainly in writing but also orally.
- LO2. Demonstrate knowledge of fundamental algorithms for several problems, for example algorithms to compute convex hulls, triangulate polygons, low-dimensional linear programming and Voronoi diagrams, knowledge of fundamental general algorithmic design techniques, such as greedy, dynamic programming and divide-and-conquer.
- LO3. Read, understand, analyze and modify a given algorithm. Ability to design algorithmic solutions for given geometric problems.
- LO4. Attack theoretical and practical problems in various application domains.
- LO5. Understand and apply important techniques and results in computational geometry.
- LO6. Analyze the complexity of a given algorithm.
- LO7. Demonstrate knowledge of fundamental geometric data structures, such as data structures for range searching, point location, and segment intersection. Demonstrate knowledge of fundamental general design techniques for data structures, such as multi-level trees, duality and divide-and-conquer.
Unit outlines
Unit outlines will be available 2 weeks before the first day of teaching for the relevant session.
- Semester 1, 2024 [Normal day] - Camperdown/Darlington, Sydney
- Semester 1, 2020 [Normal day] - Camperdown/Darlington, Sydney
- Semester 1, 2022 [Normal day] - Camperdown/Darlington, Sydney
- Semester 1, 2022 [Normal day] - Remote
- Key dates
Key dates through the academic year, including teaching periods, census, payment deadlines and exams.
- Student administration
Enrolment, course planning, fees, graduation, support services, student IT
- Expectations of student conduct
Code of Conduct for Students, Conditions of Enrollment, University Privacy Statement, Academic Integrity
- Academic appeals
Academic appeals process, special consideration, rules and guidelines, advice and support
- Learning and teaching policy
Policy register, policy search
- Financial support
Scholarships, interest free loans, bursaries, money management
- Study resources
Learning Centre, faculty and school programs, Library, online resources
- Health and support
Student Centre, counselling & psychological services, University Health Service, general health and wellbeing
