Computational Geometry

1.5 credits · Undergraduate

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