#	Date	Topic
Papers » Geometric Fundamentals
1	08/28	Models of computation, geometric primitives, lower bounds	[PS P.19-35]
Papers » Convex Hull
2	09/02	2D convex hull	[PS Ch3; dBKOS Ch1]
3	09/04	Convex hull in high dimensions	[PS Ch3; dBKOS Ch11]
4	09/09	Randomized incremental construction (RIC) for convex hull	[dBKOS Ch11; GO Ch22; Sei ; Lecture notes]
Papers » Intersection Detection
5	09/11	Segment intersection: sweep-line algorithm, RIC	[dBKOS Ch2]
6	09/16	RIC analysis, polyhedra intersection	[dBKOS Ch6; Mu]
Papers »Geometric Data Structures
7	09/18	Segment, interval, priority-search trees	[dBKOS Ch5, 11]
8	09/23	Orthogonal range searching: kd-tree, quad tree, range tree	[dBKOS Ch5; GO Ch36]
9	09/25	Planar point location	[dBKOS Ch6; PS Ch2; ST]
Papers »Proximity Problems
10	09/30	Voronoi diagram (VD), Delaunay triangulation (DT)	[dBKOS Ch7]
11	10/02	RIC for DT, subgraphs of DT	[dBKOS Ch9; Ed P.9-17]
Papers »Arrangements
12	10/07	Arrangements of lines and curves, lower envelope, zone theorem	[dBKOS Ch8; PA Ch 10]
13	10/09	Levels and incidences in arrangements	[Ma Ch 4 and 11; Dey]
Papers »Triangulation
14	10/16	Polygon triangulation	[Sei]
15	10/21	Point-set triangulation, Steiner triangulation, Delaunay refinement	[Ed Ch2]
Papers »Geometric Sampling
16	10/23	Random sampling, e-nets and e-approximations	[PA Ch 15 & 16]
17	10/28	Cuttings and their applications	[Ma Ch 4 & 6]
18	10/30	Random sampling, Core sets	[ Random sampling, Survey on core sets]
Papers »Geometric Data Structures II
19	11/04	Core sets	[Extent measures]
20	11/06	Simplex range searching, Data streaming	[dBKOS Ch 16, Survey ]
Papers »Geometric Optimization
21	11/11	Linear programming	[Clarkson]
22	11/13	Parametric searching	[Megiddo, Survey]
23	11/18	Shape Matching
24	11/20	Clustering [Survey]
Embeddings
25	11/23	Future Directions