COMP5045 Computational Geometry Complete Course Notes (High Distinction)

Description

These COMP5045 notes include my raw personal lecture notes, laboratory examples, and textbook summaries. I received a final mark of 90 (High Distinction). TOPIC LIST * The art gallery problem * Sweepline algorithms * Convex hull * Linear programming * Range search (4 algorithms) * Voronoi diagrams * Line and plane duality * Point location search algorithms * Approximation algorithms * Curve similarity algorithms + Semester review