COMP 507

3 credits

Computational Geometry

Computer Science (Sci): Problems in computational geometry; worst-case complexity of geometric algorithms; expected complexity of geometric algorithms and geometric probability; geometric intersection problems; nearest neighbour searching; point inclusion problems; distance between sets; diameter and convex hull of a set; polygon decomposition; the Voronoi diagram and other planar graphs; updating and deleting from geometric structures.

Offered by: Computer Science

- Terms
- This course is not scheduled for the 2012-2013 academic year.

- Instructors
- There are no professors associated with this course for the 2012-2013 academic year.