Roughing Algorithm for Sculptured Surface Cavity Machining by Using Spiral Tool Paths

碩士 === 中原大學 === 機械工程研究所 === 81 === The complexities of sculptured surfaces often make machining difficult and inefficient. Spiral-out pocket machining is considered the most efficient roughing method. However, the radial depth of cut varies...

Full description

Bibliographic Details
Main Authors: Huang,Geng Woei, 黃競褘
Other Authors: Chang,Ien Phong;Tsai,Men Dar
Format: Others
Language:zh-TW
Published: 1993
Online Access:http://ndltd.ncl.edu.tw/handle/69299441379920179836
id ndltd-TW-081CYCU0489018
record_format oai_dc
spelling ndltd-TW-081CYCU04890182015-10-13T17:44:41Z http://ndltd.ncl.edu.tw/handle/69299441379920179836 Roughing Algorithm for Sculptured Surface Cavity Machining by Using Spiral Tool Paths 適用螺旋狀刀具路徑之曲面粗加工法 Huang,Geng Woei 黃競褘 碩士 中原大學 機械工程研究所 81 The complexities of sculptured surfaces often make machining difficult and inefficient. Spiral-out pocket machining is considered the most efficient roughing method. However, the radial depth of cut varies with the geometry shape of the tool path during spiral-out pocketing. This variance may cause chatter or excess tool deflection problems. We have developed calculation methods of the actual radial depth of cut for circular tool paths. However, for applying these methods to cavity machining of sculptured surface, the pocket boundaries of free-form curves should be approximated with circular arcs. Besides, the error should be located on the pocket side of the approximated curve. In this thesis, we use the circlar arcs which have centers located on the isometric line of two end points of a curve element to approximate the curve. Then, based on the Voronoi diagram we develop NC programming subroutines for cavity roughing. Chang,Ien Phong;Tsai,Men Dar 張義鋒;蔡明達 1993 學位論文 ; thesis 72 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 中原大學 === 機械工程研究所 === 81 === The complexities of sculptured surfaces often make machining difficult and inefficient. Spiral-out pocket machining is considered the most efficient roughing method. However, the radial depth of cut varies with the geometry shape of the tool path during spiral-out pocketing. This variance may cause chatter or excess tool deflection problems. We have developed calculation methods of the actual radial depth of cut for circular tool paths. However, for applying these methods to cavity machining of sculptured surface, the pocket boundaries of free-form curves should be approximated with circular arcs. Besides, the error should be located on the pocket side of the approximated curve. In this thesis, we use the circlar arcs which have centers located on the isometric line of two end points of a curve element to approximate the curve. Then, based on the Voronoi diagram we develop NC programming subroutines for cavity roughing.
author2 Chang,Ien Phong;Tsai,Men Dar
author_facet Chang,Ien Phong;Tsai,Men Dar
Huang,Geng Woei
黃競褘
author Huang,Geng Woei
黃競褘
spellingShingle Huang,Geng Woei
黃競褘
Roughing Algorithm for Sculptured Surface Cavity Machining by Using Spiral Tool Paths
author_sort Huang,Geng Woei
title Roughing Algorithm for Sculptured Surface Cavity Machining by Using Spiral Tool Paths
title_short Roughing Algorithm for Sculptured Surface Cavity Machining by Using Spiral Tool Paths
title_full Roughing Algorithm for Sculptured Surface Cavity Machining by Using Spiral Tool Paths
title_fullStr Roughing Algorithm for Sculptured Surface Cavity Machining by Using Spiral Tool Paths
title_full_unstemmed Roughing Algorithm for Sculptured Surface Cavity Machining by Using Spiral Tool Paths
title_sort roughing algorithm for sculptured surface cavity machining by using spiral tool paths
publishDate 1993
url http://ndltd.ncl.edu.tw/handle/69299441379920179836
work_keys_str_mv AT huanggengwoei roughingalgorithmforsculpturedsurfacecavitymachiningbyusingspiraltoolpaths
AT huángjìnghuī roughingalgorithmforsculpturedsurfacecavitymachiningbyusingspiraltoolpaths
AT huanggengwoei shìyòngluóxuánzhuàngdāojùlùjìngzhīqūmiàncūjiāgōngfǎ
AT huángjìnghuī shìyòngluóxuánzhuàngdāojùlùjìngzhīqūmiàncūjiāgōngfǎ
_version_ 1717784195972988928