Course Calendar

Jan 11, Lecture 1:
Introduction & Convex Hulls

Textbook Reading:

• CGAA Chapter 1

Jan 14, Lecture 2:
Line Segment Intersections

Textbook Reading:

• CGAA Chapter 2.1

Jan 18, Lecture 3:
Map Overlay & Adjacency Data Structures

Textbook Reading:

• CGAA Chapter 2.2 & 2.3

Jan 21, Lecture 4:
Polygon Triangulation, part 1

Textbook Reading:

• CGAA Chapter 3.1

Last day to add courses

Jan 25, Lecture 5:
Polygon Triangulation, part 2

Textbook Reading:

• CGAA Chapter 3.2 & 3.3

Jan 28, Lecture 6:
Half-Plane Intersection

Textbook Reading:

• CGAA Chapter 4.1-4.4

Feb 1, Lecture 7:
Bounding Spheres & Randomized Incremental Construction

Textbook Reading:

• CGAA Chapter 4.7

Feb 4, Lecture 8:
Orthogonal Range Searching & k-D Trees

Textbook Reading:

• CGAA Chapter 5

Feb 8, Lecture 9:
Point Location

Textbook Reading:

• CGAA Chapter 6

Feb 11, Lecture 10:
Voronoi Diagrams, part 1

Textbook Reading:

• CGAA Chapter 7.1 & 7.2

Feb 15, Lecture 11:
Voronoi Diagrams, part 2

Textbook Reading:

• CGAA Chapter 7.3 & 7.4

Feb 18, Lecture 12:
Voronoi Diagrams, part 3

Optional References:

• Computational Geometry: An Introduction, Preparata & Shamos, 1985
• Constrained Planar Remeshing for Architecture, Cutler & Whiting, Graphics Interface 2007

Mar 1, Lecture 13:
Duality & Arrangements of Lines

Textbook Reading:

• CGAA Chapter 8

Mar 4, Lecture 14:
Delaunay Triangulations, part 1

Textbook Reading:

• CGAA Chapter 9.1 & 9.2

Last day to drop courses

Mar 15, Lecture 15:
More (Delaunay) Triangulations, part 2

Textbook Reading:

• CGAA Chapter 9.3

Optional Reference:

• Discrete and Computational Geometry, Devadoss & O'Rourke, 2011

Mar 18, Lecture 16:
Windowing, Interval & Segment Trees

Textbook Reading:

• CGAA Chapter 10

Mar 22, Lecture 17:
QuadTrees

Textbook Reading:

• CGAA Chapter 14

Mar 25, Lecture 18:
Isocontours, Level Sets, and Fast Marching Method

Mar 29, Lecture 19:
Polyominoes & Tiling

Optional Reference:

• "Chapter 14: Polyominoes", Barequet, Golomb, & Klarner, Handbook of Discrete and Computational Geometry, 2018

Apr 1, Lecture 20:
Periodic & Non-Periodic Tiling

Optional Reference:

• "Chapter 3: Tiling", Harriss, Schattschneider, & Senechal, Handbook of Discrete and Computational Geometry, 2018

Apr 5, Lecture 21:
Binary Space Partitions

Textbook Reading:

• CGAA Chapter 12

Apr 8, Lecture 22:
General Position, Robustness, & Exact Computation

Optional References:

• "Invited Lecture: Real Numbers and Robustness in Computational Geometry", Stefan Schirra, Real Numbers and Computers, 2004
• "Classroom examples of robustness problems in geometric computations", Kettner, Mehlhorn, Pion, Schirra, & Yap, Elsevier 2008

Apr 12, Lecture 23:
Robot Motion Planning

Textbook Reading:

• CGAA Chapter 13

Apr 15, Lecture 24:
Curves & Sketching

Optional References:

• Long Tiny Loops, Dan Aminzade, 2020
• "Sketching Piecewise Clothoid Curves", McCrae & Singh, 2008
• "Sketching Clothoid Splines Using Shortest Paths", Baran, Lehtinen, & Popovic, 2010

Apr 19, Lecture 25:
Sprouts & Brussels Sprouts

Optional References:

• "Of Sprouts and Brussels Sprouts, games with a topological flavor", Martin Gardner, Scientific American, July 1967
• "Computer Analysis of Sprouts", Applegate, Jacobs, & Sleator, 1990