| # |
Date |
Topic |
|
| 1 | 08/29 |
Models of computation, geometric primitives, lower bounds◊
Lecture notes Amit Patel |
|
| 2 |
09/01 |
|
| 3 | 09/06 | |
| 4 |
09/08 |
Randomized incremental construction (RIC) for convex hull◊ Lecture notes Amber Stillings |
|
| 5 |
09/13 |
Segment intersection: sweep-line algorithm, RIC◊ Lecture notes Sam Slee |
| 6 |
09/15 |
RIC analysis, polyhedra intersection◊ Lecture notes Amber Stillings |
|
| 7 |
09/20 |
Segment, interval, priority-search
trees, quad trees◊ Lecture notes Mason Matthews |
| 8 |
09/22 |
|
| 9 |
09/27 |
Planar point location |
|
| 10 |
09/29 |
|
| 11 |
10/04 |
Voronoi diagram (VD), Delaunay triangulation (DT) ◊ Lecture Notes Urmi Majumder |
| 12 |
10/06 |
|
|
| 13 |
10/13 |
Arrangements of lines and curves,
lower envelope, zone theorem |
| 14 |
10/18 |
Levels and incidences in arrangements◊ Scribe: Khalid Al Issa |
| 15 |
10/20 |
Arrangements of hyperplanes |
|
| 16 |
10/25 |
Polygon triangulation |
| 17 |
10/27 |
Point-set triangulation,
Delaunay refinement |
|
| 18 |
11/01 |
Random sampling, ε-nets and ε-approximations◊ Lecture Notes Amber Stillings |
| 19 |
11/03 |
Cuttings and their applications |
| 20 |
11/08 |
Simplex range searching◊ Scribe: Khalid Al Issa |
| 21 |
11/10 |
Partition trees |
|
| 22 |
11/15 |
Linear programming |
| 23 |
11/17 |
LP-type problems |
| 24 |
11/22 |
Parametric searching |
| 25 |
11/29 |
Convex approximation |
|
|
| 26 |
12/01 |
Motion Planning
|
