摘要(英) |
ABSTRACT
Computer aid design (CAD) and Computer aid Manufacture (CAM) are extensively used in industry. At first we should use 3D scanning (the measurement and modeling of shape and other visual properties) to modeling a physical model into triangular model in reverse engineering, then construct a surface model from triangular model, and this thesis has a goal to discuss several methods to deal with triangular mesh, and accelerates step in turning triangular model to surface model. Therefore designing a data structure at first to process triangular mesh easily, and use this data structure to smooth triangular mesh, detect holes and patch holes in triangular model.
This thesis includes data structure, smooth, hole-detecting, hole-filling and decimation in triangular model. Use graphic node to build dynamic mesh data structure. and using this data structure to process triangular mesh. In smooth mesh, use mesh vertex projection to accomplish an intention. Using mesh edges to accomplish mesh hole-detecting. Use ear-cutting to do triangulation for hole-filling and take mesh normal difference to do mesh decimation. |
參考文獻 |
參考文獻
1. M. Botsch, S. Steinberg, S. Bischoff and L. Kobbelt, “OpenMesh-a generic and efficient polygon mesh datastructure”, Computer Graphics and Multimedia RwTH Aachen .
2. Levin,A., “Combined subdivision schemes for the design of surfaces satisfying boundary conditions on conditions” , Computer Aieded Geometric Design, No 16, pp. 345-354, 1999.
3. Hoppe H, “Surface Reconstruction from Unorganized Points” , P.H.D of University of Washington ,1994.
4. Kahler K, Haber J, and Hans-Peter S, “Dynamically refining animated triangle meshes for rendering” , Vistual Computer 2003.
5. Gieng T.S., Hamann B, Kenneth I , L.Schussman and J.Trotts, “Smooth Hierarchical Surface Triangulation”, Center for Image Processing Integrated Computing Department , 1997.
6. Davis J, R. Marschner , Garr M and Levoy M, “Filling Holes in Complex Surface using Volumetric Diffusion”, Computer Science Department , Stanford University.
7. Y . H. Chen, C. T. Ng and Y. Z. Wang, “General of an STL File from 3D Measurement Data with User-Controlled Data Reduction” Department of Mechanical Engineering, The University of Hong Kong,1999.
8. S. Gieng, B. Hamann, Member, IEEE, I. Joy, Memmber, IEEE, Gregory L.Schussman, IEEE, and Issac J. Trotts“Constructing Hierarchies for Triangle Meshes” IEEE transaction on visualization and computer graphics,vol.4,no2,april-june 1998.
9. A.Ciampalini, P. Cignoni, C. Montani, R.Scopigno , “Multiresolution decimiation based on global error” ,Visual Computer 13:228-246, 1997.
10. Eppstein D, “The Farthest Point Delaunay Triangulation Minimizes Angles”, Department of Information and Computer Science ,1990.
11. Thomas, “A Review of Two Simple Polygon Triangulation Algorithms,” June 3,1998.
12. Held M “Fast Industrial-Strength Triangulation of Polygons”, University Salzburg Austria, 1998. |