C S 575 - Computational Geometry

3 Credits

Computational complexity of geometric problems within the framework of analysis of algorithms. Stress on geometric searching, intersection problems, particularly of rectangles, and fundamental algorithms. Practical applications of concepts developed can be found in computer graphics, analysis of algorithms, spatial data structures and VLSI system design.Prerequisites: C S 472/572, C S 480/580 or instructor’s consent.