CS 498 TC4

CS 498 TC4 - Computational Geometry

Spring 2021

TitleRubricSectionCRNTypeHoursTimesDaysLocationInstructor
Computational GeometryCS498TC367775E431100 - 1215 T R    
Computational GeometryCS498TC467785E441100 - 1215 T R    Jeff Erickson

Official Description

Subject offerings of new and developing areas of knowledge in computer science intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. Course Information: 1 to 4 undergraduate hours. 1 to 4 graduate hours. May be repeated in the same or separate terms if topics vary.

Section Description

Title: Computational Geometry Description: Design and analysis of efficient algorithms for fundamental geometric problems, including convex hulls, Voronoi diagrams, geometric range searching, line segment intersection, polygon triangulation, low-dimensional linear programming, and visibility. Applications of geometric algorithms in computer graphics, mesh generation, geographic information systems, VLSI design, and other areas of computing. A solid background in algorithms (at the level of CS 374) is assumed. Preferred Prerequisite: CS 374