CPSCI-307 Topics in Computer Science II
Investigating the intersection of computing and geometry using the lens of algorithms and data structures. A combination of theory and programming. Topics include the representation of geometric objects, the challenges of computing with them, and classical problems, such as convex hulls, range searching, line segment intersection, lower envelopes, linear programming; as well as well-known algorithmic techniques and data structures: the sweepline method, range trees, interval trees, k-d trees, among others.
10
Credits
1
Prerequisite
CPSCI-111 and CPSCI-123, or CPSCI-230