Useful links
Unit of study_
COMP4445: Computational Geometry
2025 unit information
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
Managing faculty or University school:
Engineering
| Study level | Undergraduate |
|---|---|
| Academic unit | Computer Science |
| Credit points | 6 |
|
Prerequisites:
?
|
(DATA3888 or COMP3888 or COMP3988 or CSEC3888 or SOFT3888 or ENGG3112 or SCPU3001) and (COMP2123 or COMP2823) and (COMP3027 or COMP3927) |
|---|---|
|
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:
?
|
A major in a computer science area. Discrete mathematics and probability (e.g. MATH1064 or equivalent) |
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 availability
This section lists the session, attendance modes and locations the unit is available in. There is a unit outline for each of the unit availabilities, which gives you information about the unit including assessment details and a schedule of weekly activities.
The outline is published 2 weeks before the first day of teaching. You can look at previous outlines for a guide to the details of a unit.
| Session | MoA ? | Location | Outline ? |
|---|---|---|---|
|
Semester 1 2025
|
Normal day | Camperdown/Darlington, Sydney |
Outline unavailable
|
Find your current year census dates
Modes of attendance (MoA)
This refers to the Mode of attendance (MoA) for the unit as it appears when you’re selecting your units in Sydney Student. Find more information about modes of attendance on our website.
