CMPSC 235 - Computational Geometry

Algorithms and lower bound techniques in computational geometry; decision tree models of computation; geometric searching; point location and range search; convex hull and maxima of a point set; proximity algorithms; geometric intersections.

Prerequisites: Computer Science 130A-B.

CMPSC 235

31 / 35 Enrolled

Computational Geometry

Subhash Suri 4.6

T R

11:00 AM - 12:50 PM

78.9% A