Fundamental Techniques, Data Structures and Algorithms For Solving Geometric Problems, Such As Computing Convex Hulls, Intersection Of Line Segments, The Voronoi Diagram and Delaunay Triangulation of A Point Set, Polygon Triangulation, Range Search, Linear Programming, Point Location in Spaces of Any Dimension. Various Topics in Discrete Geometry Are Also Addressed (e.g., The Crossing Number of a Graph).

Faculty: Computer Science
|Undergraduate Studies |Graduate Studies

Pre-required courses

234218 - Data Structures 1

Semestrial Information