Commit Sized Bites:

Increment 1 - SIFT

1. Implement and test feature point finding algorithms
2. Implement and test feature point descriptor and bbf algorithms
3. Implement and test bundle adjustment/RANSAC
4. Implement and test 3 thesis algorithms

Increment 2 - Photo Graph

1. Understand kD trees, determine appropriate view volume
2. Implement and test a 3D tree on feature points

Increment 3 - Viewer

1. Figure out ideal memory locations and processor usage
2. Implement and test view changing equations from Ch. 1
3. Learn about smooth cutting algorithms
4. Implement and test smooth cutting algorithms