# CS 235: Computational Geometry

*
Subhash Suri *

M-W 9:00 - 10:50

Room: Phelps 1401

### Administrative Stuff

- TA: Hakan Yildiz (hakan@cs.ucsb.edu)
- TA Hours: Mondays, 3-5 PM.
- TA Location: GSL (Graduate Student Lab)
- Prof's Office Hours: Tues 11-12 AM.

### Course Description

This is an introductory course on computational geometry and its applications. We will discuss
techniques for reasoning about geometric data, and for designing computationally efficient
algorithms to process these data.
The main topics covered in the course include the following:
Convex Hulls,
Object Intersection,
Polygon triangulation,
Range Searching,
Planar Point Location,
Proximity and Voronoi Diagram,
Delaunay Triangulation,
Arrangements,
Sampling and Epsilon Nets,
Paradoxical behavior of Higher Dimensions,
Metric Embeddings.

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)
- Convex Hulls (pdf). Chan's Algorithm
- Intersection and Plane Sweep Paradigm (pdf)
- Triangulation and Art Gallery Theorem (pdf)
- Range Searching (pdf)
- Point Location Structures (pdf)
- Voronoi Diagrams, Delaunay Triangulation (pdf)
- Arrangements and Duality (pdf)
- Epsilon Nets and VC Dimension. (pdf)
- Combinatorial Geometry.
- Paradoxes of Higher Dimensions and Metric Embedding (pdf)

### Homework Assignments

Homework #1

Homework #2

Homework #3

*Subhash Suri *

Professor

Computer Science Department

Room 2111, Engr I

University of California

Santa Barbara, CA 93106

*
*