Module and Programme Catalogue

Search site

Find information on

2019/20 Taught Postgraduate Module Catalogue

COMP5821M Geometric Processing

15 creditsClass Size: 40

Module manager: Dr. Hamish Carr

Taught: Semester 2 View Timetable

Year running 2019/20

Pre-requisite qualifications

We will assume a good standard of C++ programming, including use of classes, basic templates, and overloading. Knowledge of computer architecture, in particular the memory hierarchy.


COMP5811MParallel and Concurrent Programming
COMP5812MFoundations of Modelling and Rendering

This module is not approved as an Elective

Module summary

Building on the fundamentals of rendering covered in COMP 5812M, this module focusses on geometric techniques for asset modelling, representation manipulation, and management, as well as geometric techniques for accelerating render engines.


* develop methods for mesh editing, deformation & interpolation
* introduce students to geometric error, degeneracy & robustness
* develop geometric intersection tests used for object modelling, ray-tracing, collision detection and geometric acceleration structures
* introduce students to constructive solid geometry (CSG)
* introduce algorithmic approaches to modelling natural phenomena such as procedural modelling, L-system, height fields and terrain
* develop the geometric foundations of effects such as shadows and reflection
* introduce modelling techniques such as implicit surfaces, volumetric representations, point-based rendering and image-based rendering
* introduce both isosurfaces and direct volume (volumetric) rendering techniques for working with volumetric representations
* demonstrate the use of distance field isosurfaces and other techniques for mesh repair and editing
* build geometric algorithms for geometric simplification of meshes, both online and in preprocessing
* use level-of-detail and adaptive methods to reduce rendering costs
* build geometric spatial data structures for search problems, for acceleration and for culling
* introduce Voronoi diagrams, Delaunay triangulations and convex hull algorithms, building toward surface reconstruction from point clouds
* explore texture generation and synthesis, including geometric construction of bump maps, displacement maps, &c.

Learning outcomes
On completion of this module, a student should be able to implement the techniques described above, all of which recur across problems in high-performance graphics and game engines, and most of which are primarily CPU-based techniques.


* Mesh Editing, Deformation, Simplification & Interpolation
* Volumetric Modelling & Rendering
* Surface Reconstruction, Manipulation & Repair
* Geometric Calculations
* Modelling Natural Phenomena
* Geometric Acceleration Structures
* Computational Geometry
* Point Based & Image-Based Rendering
* Texture Synthesis and Generation
* BĂ©zier curves, triangles and tensor patches
* B-splines, NURBS and subdivision curves and surfaces

Teaching methods

Delivery typeNumberLength hoursStudent hours
Private study hours66.00
Total Contact hours84.00
Total hours (100hr per 10 credits)150.00

Private study

Students will be expected to review the material presented in lectures in their own time, and demonstrate their practical competence in a selection of techniques. At the MSc level, this is best done through independent work on programming assignments, with support from the lecturer as needed.

Opportunities for Formative Feedback

Bi-weekly assignments will provide the ability to provide metered feedback without micro-managing students’ work.

Methods of assessment

Assessment typeNotes% of formal assessment
AssignmentProgramming Task10.00
AssignmentProgramming Task10.00
AssignmentProgramming Task10.00
AssignmentProgramming Task10.00
AssignmentProgramming Task10.00
Total percentage (Assessment Coursework)50.00

Normally resits will be assessed by the same methodology as the first attempt, unless otherwise stated

Exam typeExam duration% of formal assessment
Unseen exam 2 hr 00 mins50.00
Total percentage (Assessment Exams)50.00

Normally resits will be assessed by the same methodology as the first attempt, unless otherwise stated

Reading list

The reading list is available from the Library website

Last updated: 11/06/2019


Browse Other Catalogues

Errors, omissions, failed links etc should be notified to the Catalogue Team.PROD

© Copyright Leeds 2019