Download Page:
http://cggmwww.csie.nctu.edu.tw/research/index.php?research=mesh
Presentation Slides( for my Master Defense):
Highlight:
A novel approach for user to precisely increase the vertex resolution of desired regions on the simplified mesh, while preserving the global vertex count:
Algorithm Summary:
- Generate a Progressive Mesh (PM) for the model: a continuous sequence of edge collages that will gradually reduce the model to only 1 vertices.
- In the PM, locate all edge collapse pairs on the target region to be refined, denoted as eg.
- Specify the desired global vertex count after simplification, denoted as g.
- Specify the desired vertex count for the target region after simplification, denoted as x.
- Identify ecX, which is the marginal edge collapse that will immediately reduce the target region to x vertices.
- Exchange the order of ecX with the (g+1)-th edge collapse of PM, making it the new (g+1)-th edge collapse of PM.
- Linearly reallocate the execution order of all other edge collapses of eg to preserve the original order of eg.
- As a result, the target region will have x vertices after simplification.
Result:
User can precisely allocate more vertices to regions of interest on a simplified mesh.
Note:
This paper is primarily based on my Master thesis paper. Mr. Ho, a senior PhD. student of my lab, helped re-organized and submitting this paper.
