English
| 正體中文 |
简体中文
|
全文筆數/總筆數 : 2928/5721 (51%)
造訪人次 : 373821 線上人數 : 408
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by
NTU Library IR team.
搜尋範圍
全部NCUTIR
工程學院
機械工程系(所)
--【機械工程系】期刊論文
查詢小技巧:
您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
進階搜尋
主頁
‧
登入
‧
上傳
‧
說明
‧
關於NCUTIR
‧
管理
勤益科大機構典藏
>
工程學院
>
機械工程系(所)
>
【機械工程系】期刊論文
>
Item 987654321/6603
資料載入中.....
書目資料匯出
Endnote RIS 格式資料匯出
Bibtex 格式資料匯出
引文資訊
資料載入中.....
資料載入中.....
請使用永久網址來引用或連結此文件:
http://ir.lib.ncut.edu.tw/handle/987654321/6603
題名:
Boolean-based Operation on Overlapping CL Paths for 3D Models
作者:
洪瑞斌
貢獻者:
機械工程(學)系
日期:
2011-06
上傳時間:
2017-11-14 09:36:11 (UTC+8)
摘要:
A 3D model can be machined in sections by dividing with cutting slices vertical to the z-axis. This paper introduces a Boolean-based algorithm for planar profiles, which is a frequent implementation for overlapping elimination in CL paths generation. In the proposed algorithm, the profiles can be convex or concave, with or without islands. It is available for general planar profiles on contouring and pocketing machining. This algorithm searches for all intervals split by intersections of complicate planar profiles directly and transforms 2D transversal intersection problems into 1D interval identifications. It uses a simple but efficient odd-even determination based on interval-linked sets by tracking the intersections along the governing profile. Depending on the operation of Boolean union, intersection, and difference between two profiles, the solutions can be obtained under the same manipulation procedures. This proposed algorithm can be easily adapted to Boolean operations between regions composed of general closed profiles and be implemented on computerised CAD/CAM systems. Examples with various multiple profiles are demonstrated. © 2012 Copyright Taylor and Francis Group, LLC. (21 refs)
關聯:
International Journal of Production Research.
顯示於類別:
[機械工程系(所)] 【機械工程系】期刊論文
文件中的檔案:
沒有與此文件相關的檔案.
檢視Licence
在NCUTIR中所有的資料項目都受到原著作權保護.
DSpace Software
Copyright © 2002-2004
MIT
&
Hewlett-Packard
/
Enhanced by
NTU Library IR team
Copyright ©
-
回饋