Computational Geometry (CS-0163)

Fall 2025 · CS 0163 · Tufts University · 3 credits · Undergraduate

Design and analysis of algorithms for geometric problems. Topics include proof of lower bounds, convex hulls, searching and point location, plane sweep and arrangements of lines, Voronoi diagrams, intersection problems, decomposition and partitioning, farthest-pairs and closest-pairs, rectilinear computational geometry. Recommendations: CS 160

Course codes: CS-0163, CS 0163, CS0163, CS-163, CS 163, CS163, MATH-0181, MATH 0181, MATH0181, MATH-181, MATH 181, MATH181

Course Discovery