Catalog Description: <Formerly 292T>. 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.

Units: 3

Related Areas:

• Graphics (GR)
• Scientific Computing (SCI)
• Theory (THY)

Prerequisites: COMPSCI 170

Formats:
Fall: 3.0 hours of lecture per week
Spring: 3.0 hours of lecture per week

Grading Basis: letter

Final Exam Status: No final exam

---

Class homepage on inst.eecs

Links:

• CS enrollment policies
• EE enrollment policies
• HKN course maps