DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, Byoung Kyu | ko |
dc.contributor.author | PARK, JW | ko |
dc.contributor.author | JUN, CS | ko |
dc.date.accessioned | 2013-02-25T07:53:52Z | - |
dc.date.available | 2013-02-25T07:53:52Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1993-06 | - |
dc.identifier.citation | COMPUTER-AIDED DESIGN, v.25, no.6, pp.377 - 386 | - |
dc.identifier.issn | 0010-4485 | - |
dc.identifier.uri | http://hdl.handle.net/10203/60642 | - |
dc.description.abstract | A method of generating 'optimal' cutter-location data for 5-axis NC contour milling from given cutter-contact data is presented in the paper. The cutter-location data-optimization problem is formulated as a 2D constrained minimization problem. The cutter orientation angles consisting of the tilt angle alpha and yaw angle beta are used as decision variables. An analytic expression for approximate cusp heights is derived as a function of alpha, beta (for a given path interval) to be used as a measure of optimality. The proposed optimization scheme has been successfully applied in the 5-axis face milling of large marine propellers. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCI LTD | - |
dc.title | CUTTER-LOCATION DATA OPTIMIZATION IN 5-AXIS SURFACE MACHINING | - |
dc.type | Article | - |
dc.identifier.wosid | A1993LH32900007 | - |
dc.identifier.scopusid | 2-s2.0-0027612592 | - |
dc.type.rims | ART | - |
dc.citation.volume | 25 | - |
dc.citation.issue | 6 | - |
dc.citation.beginningpage | 377 | - |
dc.citation.endingpage | 386 | - |
dc.citation.publicationname | COMPUTER-AIDED DESIGN | - |
dc.contributor.localauthor | Choi, Byoung Kyu | - |
dc.contributor.nonIdAuthor | PARK, JW | - |
dc.contributor.nonIdAuthor | JUN, CS | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | 5-AXIS NC MACHINING | - |
dc.subject.keywordAuthor | CUTTER-LOCATION DATA GENERATION | - |
dc.subject.keywordAuthor | CUSP HEIGHTS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.