Computational Geometry

3 cr · Graduate

The design and analysis of efficient algorithms for geometric problems. Possible topics include convex hull algorithms; Voronoi diagrams and Delaunay triangulations; point location; range searching; geometric data structures; geometric intersection algorithms; guarding and visibility graphs; geometric packing, covering, and partitioning; geometric duality; arrangements of lines and circles; unit disc graphs and proximity graphs.