# CS 235: Computational Geometry

*
Subhash Suri *

M-W 1:00 - 2:50

Room: PHELP 3526

### Administrative Stuff

- Office Hours: Thur 10-12 AM.

### Course Description

This is an introductory course on computational geometry and its applications.
The primary focus is on algorithms and data structures for processing multi-dimensional and
geometric data.
The main topics covered in the course include the following:
Multi-dimensional Range Searching,
Convex Hulls,
Intersection Detection,
Polygon Triangulation,
Point Location,
Proximity and Voronoi Diagram,
Delaunay Triangulation,
Arrangements,
Sampling and Epsilon Nets, and
Lower Bounds.

This is a graduate level course, and students are expected to know the basic concepts of
* algorithm analysis * (asymptotic notation, worst-case analysis) * and data
structures * (linked lists, trees, priority queues).

### Grading and Workload

Students can expect 3-4 written homework assignments, a midterm and a final
exam. They will also be expected to read additional advanced material, not covered
in lectures, from research papers.

** Click here for the tentative schedule of lectures and exams. **

### Textbook and Lecture Notes

The textbook for the course is ** Computational Geometry**,
by de Berg, van Kreveld, Overmars, and Schwarzkopf.
This is a fairly well-written introductory textbook.
In addition, my own lecture slides will be available below.
However, keep in mind that these slides are **not an excuse** to skip
lectures. The lectures typically involve worked examples and interaction
in the form of questions and answers, which can't be captured in the slides.

- Introduction (pdf)
- Multi-Dimensional Divide and Conquer (pdf)
- kD-Treee and Range Searching (pdf)
- Intersection and Plane Sweep Paradigm (pdf)
- Triangulation and Art Gallery Theorem (pdf)
- Point Location Structures (pdf)
- Convex Hulls (pdf). Chan's Algorithm
- Voronoi Diagrams, Delaunay Triangulation (pdf)
- Arrangements and Duality (pdf)
- Epsilon Nets and VC Dimension. (pdf)
- Combinatorial Geometry.
- Lower bounds. (pdf)

*Subhash Suri *

Professor

Computer Science Department

Room 2111, Engr I

University of California

Santa Barbara, CA 93106

*
*