Engineering - Course - Computational Geometry

Basic geometric concepts: points, lines, polygons, subdivisions, arrangements. Constructing convex hulls. Plane-sweep algorithms: Line-segment intersections. Proximity problems: closest pair, furthest pair, Voronoi diagrams. Point location. Geometric data structures: segment tree, interval tree, range tree, priority search tree.