Computational Geometry
3.0
creditsAverage Course Rating
This course will provide an introduction to computational geometry. It will cover a number of topics in two- and three-dimensions, including polygon triangulations and partitions, convex hulls, Delaunay and Voronoi diagrams, arrangements, and spatial queries. Time-permitting, we will also look at kD-trees, general BSP-trees, and quadtrees. [Analysis] Recommended Course Background: EN.600.120 AND EN.600.226 AND (EN.600.363 OR EN.600.463).
No Course Evaluations found