臺灣博碩士論文加值系統

三維幾何物件常用的表示法是網格表示法. 然而由於原始設計網格結構的問題, 許多現存演算法在處理網格結構的時候, 會面臨到許多困難.在這方面的研究中, 我們使用切割演算法來移除拓璞奇異性, 並且套用三角化演算法來產生一個修補平面填補破洞. 同時我門發現三角話演算法會產生新的拓璞問題. 因此, 我們提出新的方法去解決上述的問題. 實驗結果已經展現所以出的方法的確可以移除潛在的拓璞問

Mesh representation is a common choice for representing 3-D geometric models. However, due to the original design problems of mesh structure, many existing algorithms devised for creating mesh structures are facing challenges when processing these mesh models. In this work, we make use of cutting algorithm to remove topological singularities and then apply triangulation algorithm to generate patches to fill the holes. We find the existing cutting algorithms fused with a hole-filling algorithm with generate new topological problems. Therefore, we propose a new method to solve the above mentioned problem. Experiment results have shown that the proposed solution is indeed valid in removing potential topological problems.

[1] G. Barequet and M. Sharir. Filing gaps in the boundary of a polyhedron. Computer
Aided Geometric Design, 12(2):207–229, 1995.
[2] Guezi´ec and G. Taubin. Cutting and stitching: converting sets of polygons to manifold
surfaces. IEEE Trans. Visualization and Computer Graphics, 7(2), 2001.
[3] T. Ju. Robust repair of polygonal meshes. Proceedings of ACM SIGGRAPH,
23(3):888–895, 2004.
[4] L. P. Kobbelt, U. Schwanecke M. Botsch, and H.-P. Seidel. Feature sensitive surface
extraction from volume data. Proceedings of ACM SIGGRAPH, pages 57–66, 2001.
[5] A. Sharf, M. Alexa, and D. Cohen-Or. Context-based surface completion. Proceedings
of ACM SIGGRAPH, 23(3):878–887, 2004.