Computational Geometry

Undergraduate catalogue

Introduction to basic concepts of geometric computing, illustrating the importance of this new field for computer graphics, solid modeling, robotics, databases, pattern recognition, and statistical analysis. Algorithms for geometric problems. Fundamental techniques, for example, convex hulls, Voronoi diagrams, intersection problems, multidimensional searching. Two 90-minute lectures. Prerequisites: 226 and 240 or 341, or equivalent.