Final Presentations

Computational Geometry
From April 24th to May 1st, 2008, the class presented their final projects. The schedule is printed below along with links to the student papers. A proceedings style copy of all the papers is available in PDF format.

Thursday 24 April 2008

9:55–10:10 Seamless Intersection Between Triangle Meshes
David Rosen | pdf
10:14–10:29 Approximate K Nearest Neighbors in High Dimensions
George Dahl and Mary Wootters | pdf
10:33–10:48 The Road Not Taken: Creating a Path-finding Tool Using Consumer-grade GPS Equipment
Allison Barlow and Lucas Sanders | pdf
10:52–11:07 Drawing Isoglosses Algorithmically
Kit La Touche and Bryce Wiedenbeck | pdf

Tuesday 29 April 2008

9:55–10:10 The Largest Empty Circle Problem
Megan Schuster | pdf
10:14–10:29 Unbiased Congressional Districts
Alex Benn and David German | pdf
10:33–10:48 Parallelized Quadtree Interpolation
Drew Perkins

Thursday 1 May 2008

9:55–10:10 A Twist on the Art Gallery Problem
Scott Dalane and Andrew Frampton | pdf
10:14–10:29 Voronoi Natural Neighbors Interpolation
Chris Harman and Mike Johns | pdf
10:33–10:48 Bridge Detection By Road Detection
Jeff Kaufman | pdf
10:52–11:07 Image Stained Glass Using Voronoi Diagrams
Michael Gorbachi | pdf