Computational Geometry

1.5 credits · Graduate

An introduction to algorithms and data structures which are used to solve geometrical problems. Topics include geometric searching, convex polygons and hulls, Voronoi diagrams, plane sweep algorithms, proximity and intersections. Application areas discussed include computer graphics, VLSI design and graph theory.