CS 498 TC3
CS 498 TC3 - Computational Geometry
|Computational Geometry||CS498||TC3||61927||LCD||3||1100 - 1215||W F||1131 Siebel Center for Comp Sci||Jeff G Erickson|
|Computational Geometry||CS498||TC4||67785||LCD||4||1100 - 1215||W F||1131 Siebel Center for Comp Sci|
|Computational Geometry||CS498||TCU||67775||LCD||3||1100 - 1215||W F||1131 Siebel Center for Comp Sci|
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.
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. For up-to-date information about CS course restrictions, please see the following link: http://go.cs.illinois.edu/csregister