Mesh unfolding technique transforms an input 3D mesh into a single connected patch, which significantly facilitates us to construct the corresponding papercraft model. The mathematical concept of topological surgery guarantees that we can always find at least one such pair of duplicated seams that are next to each other on the boundary of the unfolded patch, thus we can construct the papercraft model just by stitching them one by one until all the seams are closed.
Project website: http://tk2-235-27457.vs.sakura.ne.jp/projects/unfolding/index-e.html
Other intertesting websites:
Website of Prof. Jyh-Ming Lien: https://cs.gmu.edu/~jmlien/doku.php
Website of Prof. Jun MITANI: http://mitani.cs.tsukuba.ac.jp/en/
This project aims to find the best position and minimal number of glue tags for 3D mesh unfolding problem.
- Knowledge of English language (source code comments and final report should be in English)
- Knowledge of C/C++ is advantageous
- Knowledge of BGL(http://www.boost.org/doc/libs/1_66_0/libs/graph/doc/index.html) and CGAL(https://www.cgal.org) is advantageous
- Commitment to collaborate with international researchers
The project should be implemented as a standalone application, desktop or web-based (to be discussed).