CSE 5406
Computational Geometry
Computational geometry is the algorithmic study of problems that involve geometric shapes such as points, lines, and polygons. Such problems appear in computer graphics, vision, robotics, animation, visualization, molecular biology, and geographic information systems. This course covers data structures that are unique to geometric computing, such as convex hull, Voronoi diagram, Delaunay triangulation, arrangement, range searching, KD-trees, and segment trees. Also covered are algorithms for polygon triangulation, path planning, and the art gallery problem. Prerequisite: CSE 347.
Instructors
Reviews
This professor is awesome. Easy class, was nervous at first but would recommend. I think underclassmen could take it.
1/12/2026
Tao is among the most awesome professors I've had at WashU. His lectures are very interactive, engaging, and crystal clear. The only catch is that the homeworks and exams can be tough. Still, if you find yourself in a position where you can take a class with Tao, you should definitely sign up.
4/19/2014
I learned more about Algs and Data Structures in this course than 241. He's SO smart and funny, I looked forward to this class every day. Uses great analogies to help students understand.
12/1/2011