Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0010-4485(00)00107-X
Title: A volume decomposition approach to machining feature extraction of casting and forging components
Authors: Kailash, S.B.
Zhang, Y.F. 
Fuh, J.Y.H. 
Keywords: Casting and forging parts
Feature extraction
Process mapping
Issue Date: Jul-2001
Citation: Kailash, S.B., Zhang, Y.F., Fuh, J.Y.H. (2001-07). A volume decomposition approach to machining feature extraction of casting and forging components. CAD Computer Aided Design 33 (8) : 605-617. ScholarBank@NUS Repository. https://doi.org/10.1016/S0010-4485(00)00107-X
Abstract: This paper reports a method for machining feature extraction of forging and casting components. It employs a volume decomposition approach to map machining removal faces into machining processes. The geometric reasoning from the characteristic surfaces produced by machining operations forms the basis of the recognition process. There are three phases in the mapping process: (1) Boolean decomposition of the final part model and raw part model; (2) identification of machined faces (M-faces) and concatenation of M-faces into groups (M-group); and (3) mapping M-groups into all feasible machining process types. This recognition technique is process oriented, which is able to overcome the limitation of new feature additions. This approach is also able to deal with some types of feature intersecting. The results can be used directly for process planning of complicated geometric parts, e.g. casting and forging components. © 2001 Elsevier Science Ltd.
Source Title: CAD Computer Aided Design
URI: http://scholarbank.nus.edu.sg/handle/10635/59337
ISSN: 00104485
DOI: 10.1016/S0010-4485(00)00107-X
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

24
checked on Oct 15, 2018

WEB OF SCIENCETM
Citations

18
checked on Oct 15, 2018

Page view(s)

47
checked on Oct 6, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.