Computer Science 274

[Email HKN about this data] [Info about this page]

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?

Fall 2006 Shewchuk 6.5 / 7 ± 0.3
6.2 / 7 ± 0.5

Spring 2005 Shewchuk 6.0 / 7 ± 0.3
5.5 / 7 ± 0.8

Spring 2003 Shewchuk 6.7 / 7 ± 0.3
6.0 / 7 ± 0.7

Spring 2000 Steiger 6.0 / 7 ± 0.7
5.3 / 7 ± 0.8

Spring 1998 Bern 5.8 / 7 ± 0.6
6.0 / 7 ± 0.6

Fall 1994 Bern 5.5 / 7 ± 2.1
5.2 / 7 ± 1.6

Spring 1994 Seidel 6.1 / 7 ± 0.6
5.9 / 7 ± 0.8

Spring 1993 Seidel 6.0 / 7 ± 0.3
5.5 / 7 ± 0.5

Spring 1991 Seidel 5.7 / 7 ± 0.7
5.5 / 7 ± 0.7

Overall Rating Teaching Effectiveness How worthwhile was this course?

Computer Science 274 6.2 / 7 ± 0.0
5.8 / 7 ± 0.1

Hint: You can click on the colored rating bars to see detailed statistics on a particular rating.