Course Calendar

Aug 29, Lecture 1:
Introduction & Convex Hulls

Textbook Reading:

• CGAA Chapter 1

Sep 1, Lecture 2:
Line Segment Intersections

Textbook Reading:

• CGAA Chapter 2.1

Sep 8, Lecture 3:
Map Overlay & Adjacency Data Structures

Textbook Reading:

• CGAA Chapter 2.2 & 2.3

Sep 12, Lecture 4:
Polygon Triangulation, part 1

Textbook Reading:

• CGAA Chapter 3.1

Sep 15, Lecture 5:
Polygon Triangulation, part 2

Textbook Reading:

• CGAA Chapter 3.2 & 3.3

Sep 19, Lecture 6:
Half-Plane Intersection

Textbook Reading:

• CGAA Chapter 4.1-4.4

Sep 22, Lecture 7:
Bounding Spheres & Randomized Incremental Construction

Textbook Reading:

• CGAA Chapter 4.7

Sep 26, Lecture 8:
Orthogonal Range Searching & k-D Trees

Textbook Reading:

• CGAA Chapter 5

Sep 29, Lecture 9:
Point Location & Trapezoidal Maps

Textbook Reading:

• CGAA Chapter 6

Oct 3, Lecture 10:
Voronoi Diagrams, part 1

Textbook Reading:

• CGAA Chapter 7.1 & 7.2

Oct 6, Lecture 11:
Voronoi Diagrams, part 2

Textbook Reading:

• CGAA Chapter 7.3 & 7.4

Oct 10, 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

Oct 17, Lecture 13:
Duality & Arrangements of Lines

Textbook Reading:

• CGAA Chapter 8

Optional Reference:

• Interpreting Physical Sketches as Architectural Models, Barbara Cutler and Joshua Nasman, Advances in Architectural Geometry 2010

Oct 20, Lecture 14:
Delaunay Triangulations, part 1

Textbook Reading:

• CGAA Chapter 9.1 & 9.2

Last day to drop courses

Oct 24, Lecture 15:
More (Delaunay) Triangulations, part 2

Textbook Reading:

• CGAA Chapter 9.3

Optional Reference:

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

Oct 27, Lecture 16:
Windowing, Interval & Segment Trees

Textbook Reading:

• CGAA Chapter 10

Oct 31, Lecture 17:
Quad Trees

Textbook Reading:

• CGAA Chapter 14

Nov 3, Lecture 18:
Isocontours, Level Sets, and Fast Marching Method

Optional References:

• "Marching Cubes: A High Resolution 3D Surface Construction Algorithm", Lorensen & Cline, SIGGRAPH 1987

Nov 7, Lecture 19:
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

Nov 10, Lecture 20:
Binary Space Partitions

Textbook Reading:

• CGAA Chapter 12

Nov 14, Lecture 21:
Polyominoes & Tiling

Optional Reference:

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

Nov 17, Lecture 22:
Periodic & Non-Periodic Tiling

Optional References:

• "Chapter 3: Tiling", Harriss, Schattschneider, & Senechal, Handbook of Discrete and Computational Geometry, 2018
• "Penrose Tiles to Trapdoor Ciphers: And the Return of Dr Matrix", Martin Gardner, 1989

Pass/No Credit deadline

Nov 21, Lecture 23:
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

Nov 28, Lecture 24:
Robot Motion Planning

Textbook Reading:

• CGAA Chapter 13

Dec 5, 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
• "Implementation of Sprouts: a graph drawing game", Cizek & Balko, Graph Drawing 2021