Submission date: Friday, 11/28/08, 23:59

Objective:

Develop and implement a mesh reconstruction tool which uses as input points + normals. Base it on everything you learned in class and any additional papers you read.

Tasks:

1. Write down an overview of the algorithm you plan to use and submit it by November 14, 2008. It should include the main approach and the description of the tools you plan to use.

2. Implement your method and test it on the standard set of example inputs (sphere, bunny, etc...). Refine the inputs as necessary to get appropriate density. Use the meshes to get the normal info. You can find other inputs on the web.

3. Your code should be able to create meshes of up to 10K triangles in reasonable time.

4. Develop a user friendly API and an effective visualization mechanism for your algorithm, where users can see the different steps, whenever possible.

5. After your implementation is complete write a report describing you final algorithm and showing both basic and non-trivial examples of reconstruction performed by your method.

Instructions:

1. You should implement a reconstruction algorithm of your choice. Probably the easiest approach would be to fit an implicit surface to the points + normals and then use marching cubes to extract the surface. You can assume the data you have is "good", i.e. dense "enough" with no noise or incorrect normals and assume the reconstructed surface is smooth.

2. Some very relevant papers:

1. B. Curless and M. Levoy. A volumetric method for building complex models from range images. In Proceedings of SIGGRAPH 96, pp. 303–312, 1996.

2. H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle. Surface reconstruction from unorganized points. In Proceedings of SIGGRAPH 92, pp. 71–78, 199

3. Reconstruction and Representation of 3D Objects with Radial Basis Functions, J. C. Carr, R. K. Beatson, J. B. Cherrie, T. J. Mitchell, W. R. Fright, B. C. McCallum, and T. R. Evans. Computer Graphics (Siggraph), pages 67-76, 2001.

4. Interactive Topology-aware Surface Reconstruction, Andrei Sharf, (Tel Aviv University) Thomas Lewiner (Pontifícia Universidade Católica do Rio de Janeiro), Gil Shklarski, Sivan Toledo, Daniel Cohen-Or (Tel Aviv University)

5. Reconstruction of Solid Models from Oriented Point Sets, M. Kazhdan, SGP 2005

3. You can use any external codes you wish (as long as they do not do the reconstruction itself :), such as solvers, marching cubes codes and so on. Document clearly what external codes you use.

4. Provide a README explaining clearly how to run your method & activate all the different features it has.

5. There will be a 10 point bonus for the best reconstruction and a five point bonus for the runner up.

Submission:

Send an email to Ian with the subject “DGP project” containing a zip file with your code. Submit your sources only – you must include the entire source-tree for your quickStart module.

Don't forget to include a README file explaining how to run your code.

In the email write your name and contact e-mail address.

All email should be received by Friday, 11/28/08, at 23:59.

No late submissions will be accepted.

This project is 30% of your final grade.