跳到主要內容

簡易檢索 / 詳目顯示

回結果列表
研究生： 張義宏
Yi-Hong Zhang
論文名稱： 光學掃描量測資料之二次曲面特徵分離
Segmentation of the Measured Point Data for Simple Surface
指導教授： 賴景義
Jing-Yih Lai
口試委員:
學位類別： 碩士
Master
系所名稱： 工學院 - 機械工程學系
Department of Mechanical Engineering
畢業學年度： 94
語文別： 中文
論文頁數： 63
中文關鍵詞： 幾何特徵萃取 、網格分離 、逆向工程
外文關鍵詞： Geometric feature extraction, mesh segmentation, reverse engineering
相關次數： 點閱：22  下載：0 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 逆向工程為ㄧ種由實體模型的三維量測資料重建CAD模型之技術，其中點資料處理是整個逆向工程的第一步，也是最重要的ㄧ環。本研究的主要目的為針對由簡單二次曲面如平面、圓柱與圓錐等組成之實體的三角網格資料，發展手動與自動之特徵分離的機制，以減少分離資料的時間並能清楚掌握模型的幾何形狀。在發展相關機制前，需先探討特徵分離的基本流程包括特徵值的計算、設定閥值與限制條件以及區域成長，再透過不同機制達到簡單二次曲面分離的目的。
    本研究處理的問題包含︰特徵分離基本流程、簡單二次曲面的判斷與再成長、手動點選分離機制與平面自動化分離。由特徵分離流程建立初步分離資料，再根據簡單二次曲面的判斷重新成長以獲得更完整且精確的資料，另外透過點選分離幫助使用者只對有興趣之區域作處理以提高效率。而自動化分離將以平面為例，在滿足誤差的前提下，一次大量分離相同形式的曲面以供後續建構需要。

    Reverse engineering is a technique to reconstruct the CAD model from the three-dimensional measured points of a physical object. Segmentation of the digitized points is the first step in reverse engineering and is most important. In order to efficiently and accurately handle the digitized points, various segmentation algorithms should be provided. The objective of the study is to develop manual and automatic feature segmentation technique for triangular meshes from objects composed of simple surface such as plane, cylinder and cone etc. Before the development of the proposed algorithm, we first analyze the basic procedure of feature segmentation, including the characteristic values, threshold, constraint conditions and region growing. We then develop algorithms to accomplish the segmentation of quadratic features such as plane, cylinder, cone and sphere. The proposed method deals with the problems such as the basic procedure for segmentation, the judgment and the growing of the meshes for quadratic surfaces, manual segmentation and automatic planar segmentation. A procedure is implemented for initial recognition of the meshes belonging to the target feature. A meshes growing procedure is then implemented to find out all meshes belonging to the same feature. The manual segmentation process can help the users to find out each quadratic feature precisely. An automatic segmentation. Several examples are presented also to illustrate the entire process and to demonstrate the feasibility of the proposed method.

    第一章 緒論 ……………………………………………………… 1 第二章 網格特徵分離 …………………………………………… 8 2.1 前言 ……………………………………………………… 8 2.2 網格點特徵值計算 ……………………………………… 8 2.2.1 網格點法向量 …………………………………….. 9 2.2.2 網格點主曲率 …………………………………….. 9 2.2.3 網格點主軸方向 …………………………………… 14 2.3 設定限制條件與閥值 …………………………………… 16 2.4 區域成長 ………………………………………………… 16 第三章 標準幾何形態之半自動化分離 ………………………… 21 3.1 前言 ……………………………………………………… 21 3.2 標準元件之判斷與修正 ………………………………… 21 3.2.1 平面 ……………………………………………….. 23 3.2.2 球面 ……………………………………………….. 23 3.2.3 圓柱面 …………………………………………….. 24 3.2.4 圓錐面 …………………………………………….. 26 3.3 標準元件嵌合 …………………………………………… 27 3.3.1 圓柱嵌合 ………………………………………….. 30 3.3.2 圓錐嵌合 ………………………………………….. 32 3.4 標準元件分離分析與討論 ……………………………… 34 第四章 平面自動化分離 ………………………………………… 39 4.1 前言 ……………………………………………………… 39 4.2 相關參數設定 …………………………………………… 39 4.3 種子點搜尋 ……………………………………………… 42 4.4 平面區域分離 …………………………………………… 43 4.5 平面分離分析與討論 ………………………………….... 44 第五章 結論與未來展望 ………………………………………… 51 5.1 結論 ……………………………………………………… 51 5.2 未來展望 ………………………………………………… 52 參考文獻 ………………………………………………………….. 53

    1. G. Taubin, “Estimating the tensor of curvature of a surface from a polyhedral approximation”, Proceedings of the 5th International Conference on Computer Vision, pp. 902-907, 1995.
    2. T. Surazhsky, E. Magid, O. Soldea, G. Elber and E. Rivlin, “A comparison of Gaussion and mean curvatures estimation methods on triangular meshes”, Proceedings of the IEEE International Conference On Robotics and Automation, 2003.
    3. P. Krsek, G. Lukacs and R. R. Martin, “Algorithms for computing curvatures from range Data”, Mathematics of Surfaces VIII, pp. 1-16, 1998.
    4. J. A. Thorpe, Elementary Topics in Differential Geometry, Springer-Verlag, 1978.
    5. 蔡耀震, 賴景義, 鍾永彬, 網格資料特徵分離, 國立中央大學機械工程研究所碩士論文, 1998.
    6. J. Huang and C. H. Menq, “Automatic data segmentation for geometric feature extraction
    from unorganized 3-D coordinate points”, IEEE Transactions on Robotics And Automation
    , 17(3), 2001.
    7. G. Lavoue, F. Dupont and A. Baskurt, “Curvature tensor based triangle mesh segmentation
    with boundary rectification”, Proceedings of Computer Graphics International, 10-17, 2004.
    8. A. Razdan and M. S. Bae, “A hybrid approach to feature segmentation of triangle meshes”,
    Computer-Aided Design, 35, pp. 783-789, 2003.
    9. H. C. Kim, S. M. Hur and S. H. Lee, “Segmentation of the measured point data in reverse
    Engineering”, Int J Adv Manuf Technol, 20, pp. 571-580, 2002.
    10. M. Vieira and K. Shimada, “Surface mesh segmentation and smooth surface extraction
    through region growing”, Computer aided geometric design, 22, pp. 771-792, 2005.
    11. N. Gelfand and L. J. Guibas, “Shape segmentation using local slippage analysis”,
    Eurographics Symposium on Geometry Processing, 2004.
    12. P. Benko and T. Varady, “Segmenting large point clouds in reverse engineering
    conventional engineering objects”, Computer and Automation Research Institute, Budapest.
    13. P. Benko, R. R. Martin and T. Varady, “Algorithms for reverse engineering boundary
    representation models”, Computer-Aided Design, 33(11), pp. 839-851, 2001.
    14. M. Vanco, “A direct approach for the segmentation of unorganized points and recognition
    of simple algebraic surfaces”, Ph.D. Dissertation, University of Technology Chemnitz,
    2002.
    15. L. Moura and R. Kitney, “A direct method for least-square circle fitting”, Computer Physics Communications, 64, pp. 57-63, 1991.
    16. 翁文德, 逆向工程之曲面模型重建技術發展, 國立中央大學機械工程研究所博士論文, 1999.

    QR CODE
    :::