| 摘要(英) |
Because the triangular mesh has characteristic which the form simple, is easy to process. And utilize triangular can form like any object, make triangular model in a lot of fields, including reverse engineering, medical skeleton model, rapid prototyping and so on, all have extensive application. However in view of the different demand, the quality of the triangular model all has the request of the certain degree, favor some following processing, like slicing, constructs surface and characteristic boundary picks up. So the wrong detection of triangular model is necessary, by the method, not only can understand wrong situation and solve but also can analysis the result of wrong triangular produced.
Have done the introduction to all possible wrong attitudes of triangular in this research, and put forward the proper solution. Moreover, divide into groups in the way to accelerate the speed that deal with of the triangular model. After finishing dealing with the mistake on the triangular format and links in relation, carry on the hole-filling finally. Make proper classification as to hole in a possible type, and obtain single and closed hole. Using the single-point type and multi-point type, the ways of two kinds of hole-filling are mended, in order to remedy the mutual deficiency each other. |
| 參考文獻 |
1. S. Melax, “A Simple, Fast, and Effective Polygon Reduction Algorithm”, Game Developer, p44-49, November, 1998.
2 M. Botsch, S. Steinberg, S. Bischoff and L. Kobbelt, “OpenMesh-ageneric and efficient polygon mesh datastructure”, Computer Graphics and Multimedia RwTH Aachen .
3. K.F. Leong, C. K. Chua and Y. M. Ng, “A Study of StereoLithography File Errors and Repair Part 1. Generic Solutions”, International Journal of Advanced Manufacturing Technology, 12:407-414, 1996.
4. K.F. Leong, C. K. Chua and Y. M. Ng, “A Study of StereoLithography File Errors and Repair Part 1. Special Cases”, International Journal of Advanced Manufacturing Technology, 12:415-422, 1996.
5. J. Wang and M.M. Oliveira, “A Hole-Filling Strategy for Reconstruction of Smooth Surfaces in Range Images”, XVI Brazilian Symposium on Computer Graphics and Image Processing(SIBGRAPI’03), October 12-15,2003.
6. Thomas, “A Review of Two Simple Polygon Triangulation Algorithms”, June 3,1998.
7. G. Lavoué, F. Dupont and A. Baskurt, “Constant Curvature Region Decomposition of 3Dmeshes by a Mixed Approach Vertex-Triangle”, Journal of WSCG, Vol.12, No.2, pp 245-252, WSCG’2004, February 2-6, Plzen, Czech Republic, 2004.
8. P. de Bruin, F. Vos, S. Frisken-Gibson, F. Post and A. Vossepoel, “Improving Mesh Quality of Extracted Surfaces using Surfacenets”, In ASCI 2000, pages 281--288, June 2000.
9. K. Poutrain and M. Contensin, “Dual Brep-CSG collision detection for general polyhedra”, Ninth Pacific Conference on Computer Graphics and Applications (PG'01), Tokyo, Japan, October 16-18, 2001.
10. Meyer M., Desbrun, M., Schroder, P. Barr and Alan H., “Discrete Differential-Geometry Operations for Triangulated 2-Manifolds”, International Workshop on Visualization and Mathematrics, Berlin,Germany, 2002.
11.林秉聖, “逆向工程之三角網格處理研究”, 國立中央大學機械工程研究所碩士論文, 2003. |
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
[檢視]
plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi
facebook
twitter
google
reddit