COMP 163/MATH 181 Computational Geometry Fall 2023 
Announcements 
Brief Description 
Computational geometry is concerned with the design and analysis of algorithms for solving geometric problems. Applications can be found in such fields as VLSI design, computer graphics, robotics, computeraided design, pattern recognition, and statistics. The aim of the course will be to introduce some basic problems of computational geometry and discuss algorithms for solving these problems. The ultimate aim will be to identify general paradigms and data structures of particular importance to solving computational geometry problems, and thereby provide the participants with a solid foundation in the field.
Topics Covered: Design and analysis of algorithms for geometric problems. Topics include proof of lower bounds, convex hulls, searching and point location, plane sweep and arrangements of lines, Voronoi diagrams, intersection problems, decomposition and partitioning, farthestpairs and closestpairs, rectilinear computational geometry.
Expected Work:
Six written homework assignments due at 11:59pm on alternate Thursdays, occasional spontaneous quizzes, two tests, an implementation/theory project, and scribing for 2 classes.
[When ready to submit notes, Login to the Tufts CS machines and type "provide cs163 classnotes file1 file2 ..." at the prompt, submitting both the pdf and the LaTex as well as any image files. Please use a filename that references the dates when the classes were scribed.]
Homework 
This list will be created during the
semester. I expect there to be six (6) homeworks, with one due roughly every two weeks, and a final project.
Instructor:Diane L. Souvaine 
Course Assistants:Alex Bai Saskia Solotko 
TextBooks and References 
Main textbook 

Joseph
O'Rourke 

Satyan L. Devadoss and Joseph
O'Rourke 

Joseph
O'Rourke and Csaba Tóth 

Franco P. Preparata,
Michael Ian Shamos 


D. P. Dobkin and D. L. Souvaine, Computational Geometry  A User's Guide. Chapter 2 of Advances in Robotics 1: Algorithmic and Geometric Aspects of Robotics, J. T. Schwartz and C. K. Yap, eds., Lawrence Erlbaum Associates, 1987, 4393. User Guide 

D. L. Souvaine Lecture Notes in Computational Geometry, 2005: Lecture Notes 2005, revised. 

D. L. Souvaine Lecture Notes in Computational Geometry, 2022f: Lecture Notes 2022f. 

D.L. Souvaine; I. BjorlingSachs The contour problem for restrictedorientation polygons: link to paper. 


Resources: TBA 



Demos 

Fortune's Algorithm Visualization, by Vladimir Porokhin (project for CS163 in Fall 2017)
Latex 
Document Preparation with Latex, by Budgen and Nelson. (Excellent)
Getting Started with Latex, by Wilkins. (Shorter but good for getting started)