Computational geometry is the study of the design and analysis of efficient algorithms for solving problems with a geometric flavor. We will discuss geometric searching, convex hulls, Voronoi diagrams, straight skeletons and triangulations
