±«ÓãÖ±²¥

COMP 507 Computational Geometry (3 credits)

Nota : Ceci est la version 2010–2011 de l’annuaire électronique. Veuillez mettre à jour l’année dans la barre d’adresse de votre navigateur pour une version plus récente de cette page, ou cliquez ici pour consulter l'annuaire la plus récente.

Offered by: Informatique (Sciences)

Vue d'ensemble

Informatique (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.

Terms: This course is not scheduled for the 2010-2011 academic year.

Instructors: There are no professors associated with this course for the 2010-2011 academic year.

  • 3 hours
  • Prerequisite: COMP 360 or COMP 362 or permission of instructor or corequisite COMP 506.
Back to top