This course covers advanced algorithms and data structures for geometric problems in two and three dimensions. Main topics include: Convex hulls in two and higher dimensions, Triangulations and planar subdivisions, Geometric search and intersection, Voronoi diagrams and Fortune's algorithm, Delaunay triangulations, Line arrangements, and Visibility.