Computer Science 274
Title | Computational Geometry |
---|---|
Units | 3 |
Prerequisites | 170 or equivalent. |
Description | Constructive problems in computational geometry: convex hulls, triangulations, Voronoi diagrams, arrangements of hyperplanes; relationships among these problems. Search problems: advanced data structures; subdivision search; various kinds of range searches. Models of computation; lower bounds. |
Sections | Instructor | Teaching Effectiveness | How worthwhile was this course? |
---|---|---|---|
Spring 2019 | Jonathan Shewchuk | ||
Spring 2017 | Jonathan Shewchuk | ||
Spring 2015 | Jonathan Shewchuk | ||
Spring 2013 | Jonathan Shewchuk | ||
Fall 2009 | Jonathan Shewchuk | ||
Fall 2006 | Jonathan Shewchuk | ||
Spring 2005 | Jonathan Shewchuk | ||
Spring 2003 | Jonathan Shewchuk | ||
Spring 2000 | William Steiger | ||
Spring 1998 | M. Bern | ||
Fall 1994 | M. Bern | ||
Spring 1994 | Raimund Seidel | ||
Spring 1993 | Raimund Seidel | ||
Spring 1991 | Raimund Seidel | ||
Overall Rating | Teaching Effectiveness | How worthwhile was this course? | |