2004

- The constrained minimum-width annulus of a set of points , by Emory Merryman .
- Proximity graphs , by Svetlana Stolpner .
- Guarding Polyhedral Terrains , by Marc G. Bellemare .
- Pattern Matching in Polyphonic Music , by Eric Blais .
- Embedding an outer-planar graph in a point set , by Andrew King .
- Hamiltonian Visibility Graphs in Sets of Independent Segments , by Joshua Auerbach .
- Sliding Coins Problems , by Francois Poirier.
- Hamiltonian Cycles in the Vertex-Adjacency Dual , by Perouz Taslakian.
- The spheres of influence graph , by Junaed Sattar .
- Envelopes of sets of lines , by Rafa Absar .

2003

- The Origami Polygon Cutting Theorem , by Eric Biunno.
- Separability of pairs of polygons through single translations , by Michel Langlois .
- Computing the largest orthogonal rectangle in a convex polygon , by Daniel Sud.
- Isomorphic triangulation of simple polygons , by Diana Garroway.
- Circular and Modular Golomb Rulers , by Justin Colannino.
- Five-coloring planar maps , by Matthew Wahab.
- Removing extrinsic degeneracies in computational geometry , by Qinghu Liao.
- Convexifying monotonic polygons , by Philipp Keller.
- Computing perspective projections , by Jean Philippe Tardif .
- The unimodal distance function in computational geometry , by Saurja Sen .
- Geometric measures of melodic similarity , by Ian Ratzer .
- Permutations of polygons , by Khaled Zeidan.
- Flipping Edges in Triangulations , by Christina Boucher.

2002

- Building of Trapezoidal Map from a set of non-intersecting lines , by Jukka Kaartinen.
- Ranking by Selection, by Thomas Lemaire.
- Computing the Fréchet distance between two polygonal curves, by Stephane Pelletier.
- Ken Clarkson's Las Vegas Algorithms for Linear Programming, by Conor Meagher ....... 2nd source.
- Primal Dual Transforms , by Chris Elliott .
- Maximum Detour and Spanning Ratio, by Olivier Duguay.
- Computational Origami, by Christian Lavoie.
- Enumeration of All Possible Unique Triangulations of a Convex Polygon, by Ajit Rajwade.
- Ham Sandwich Cuts, by Danielle MacNevin.
- How to quickly compute the area of a polygon cutting by a line, by Lianzhen Luo.
- Planar Point Location, by Paul Sandulescu .

2001

- Computing Nice Views of Objects in Space, by James Waterhouse.
- On the Deflation of Polygons, by Chris Gray.
- Curves of Constant Width, by Bradley Baetz.
- The space of line transversals of line segments, by Daria Gipsman.
- Reconfiguring Convex Polygons, by David Allard.
- Inflating 2D Triangulations to 3D Convex Polyhedra, by Ben Marlin.
- The Complexity of Guarding an Art Gallery, by Chris Wu.
- Disk Hiding, by Erin McLeish.
- Still 2 to appear...

Previous years