




CS583  Computational Geometry 



F a l l 2 0 0 5 





Instructor 

Prof. Isaac Cohen 




Textbook (required) 






Prerequesite 






Course Objective 

The objective of this course is to provide basic and advanced study of algorithms and
data structures that are particularly suitable for solving problems of geometric nature.
The course will introduce basic tools and algorithms and address fundamental problems such as
convex hulls, polygon triangulation, range search, Voronoi diagrams, Delaunay triangulations... 




Course Requirement 

There will be two exams:
Each exam will count for about 30% of the course grade. The rest of the grade will be determined by the written and programming assignments. All assignments are considered an integral part of the course and MUST be completed. Not completing assignments will automatically result in a grade of "F". 




Academic Integrity 

The USC Student Conduct Code prohibits plagiarism. All USC students are responsible for reading and following the Student Conduct Code, which appears on pp. 8397 of the 19971998 SCampus. In this course we encourage students to study together. This includes discussing general strategies to be used on individual assignments. However, all work submitted for the class is to be done individually, unless an assignment specifies otherwise. Some examples of what is not allowed by the conduct code: copying all or part of someone else's work, and submitting it as your own; giving another student in the class a copy of your assignment solution; consulting with another student during an exam. If you have questions about what is allowed, please discuss it with the instructor. Violations of the Student Conduct Code will be filed with the Office of Student Conduct, and appropriate sanctions will be given. 




Course Outline 





