English  |  正體中文  |  简体中文  |  Items with full text/Total items : 68069/68069 (100%)
Visitors : 23130913      Online Users : 150
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/26998

    Title: Interference-free cutting-path generation based on scanning data
    Authors: Lin,CY;Hwang,YY;Lai,JY
    Contributors: 機械工程研究所
    Date: 1997
    Issue Date: 2010-06-29 18:05:10 (UTC+8)
    Publisher: 中央大學
    Abstract: This work presents a novel cutting-path planning strategy for three-axis machining of 3D scanning data. A curve-fitting algorithm is employed to fit each array of the measured data into parallel sectional curves, ensuring that the effect of measurement and form errors call be substantially reduced. The best-fitting sectional curves are then used to construct a surface of triangular meshes. A modified chord-length method is also proposed to adequately control the accuracy of the triangular meshes generated. The triangular meshes are then offset along the surface normal to obtain an offset mesh surface on which the cutting paths are planned. An effective gouging detection and removal algorithm are also proposed to prevent the machined surface from overcutting. Several computer simulation results demonstrate the feasibility of the proposed strategy.
    Appears in Collections:[機械工程研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明