Class Talks in 507 in 2000

Computational Geometry Class Talks - 2004

"It usually takes more than three weeks to prepare a good impromptu speech."

Mark Twain

November 18

Eric Blais - Polygons Cuttable by a Circular Saw
Joshua Auerbach - Hamiltonian Circuits in the Path Graph of Points in Convex Position

November 23

Emory Merryman - The Discrete P-Dispersion Problem
Svetlana Stolpner - The Visibility Graph of Congruent Disks is Hamiltonian
Marc Gendron-Bellemare - Efficient Visibility Queries in Simple Polygons

November 25

Rafa Absar - Curve Reconstruction
Junaed Sattar - The Point-in-Polygon Problem for Arbitrary Polygons
Course Evaluations

November 30

Francois Poirier - Moving Coins
Andrew King - Art Gallery Theorems for Guarded Guards

Teaching Activities Homepage