YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASME
    • Journal of Manufacturing Science and Engineering
    • View Item
    •   YE&T Library
    • ASME
    • Journal of Manufacturing Science and Engineering
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    Identification of Multiple Feature Representations by Volume Decomposition for 2.5-Dimensional Components

    Source: Journal of Manufacturing Science and Engineering:;2000:;volume( 122 ):;issue: 001::page 280
    Author:
    V. Sundararajan
    ,
    Paul K. Wright
    DOI: 10.1115/1.538905
    Publisher: The American Society of Mechanical Engineers (ASME)
    Abstract: Decomposition of computer-aided design models into features that can be directly manufactured and easily translated from one representation to another has been recognized as a necessity for robust automated process planning systems. The algorithms presented here yield multiple representations of features that can be used to generate plans that are easily and efficiently manufacturable by milling processes. Features are recognized from the faces of a prismatic stock by first identifying missing regions on the external faces of the stock and then recursively descending into the part. Each missing region corresponds to a feature. As the projection of the feature is swept into the part, changes in the cross-section are identified. These denote the beginning of new features which become children of the original feature. This process yields a set of six trees, each of which resembles a depth-first search tree and is a partial ordering of features within a setup. Multiple representations are investigated for those features that are accessible from more than one direction. Corresponding features in the different trees are linked by arcs, thus yielding a feature graph. The feature graph can then be used to generate optimal features for machining depending on design or manufacturing requirements such as fixtures, tolerances, corner radii, and tool accessibility. [S1087-1357(00)01901-8]
    keyword(s): Algorithms , Tree (Data structure) , Manufacturing , Production planning , Jigs and fixtures , Corners (Structural elements) AND Machining ,
    • Download: (712.6Kb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Price: 5000 Rial
    • Statistics

      Identification of Multiple Feature Representations by Volume Decomposition for 2.5-Dimensional Components

    URI
    http://yetl.yabesh.ir/yetl1/handle/yetl/124036
    Collections
    • Journal of Manufacturing Science and Engineering

    Show full item record

    contributor authorV. Sundararajan
    contributor authorPaul K. Wright
    date accessioned2017-05-09T00:02:59Z
    date available2017-05-09T00:02:59Z
    date copyrightFebruary, 2000
    date issued2000
    identifier issn1087-1357
    identifier otherJMSEFK-27355#280_1.pdf
    identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/124036
    description abstractDecomposition of computer-aided design models into features that can be directly manufactured and easily translated from one representation to another has been recognized as a necessity for robust automated process planning systems. The algorithms presented here yield multiple representations of features that can be used to generate plans that are easily and efficiently manufacturable by milling processes. Features are recognized from the faces of a prismatic stock by first identifying missing regions on the external faces of the stock and then recursively descending into the part. Each missing region corresponds to a feature. As the projection of the feature is swept into the part, changes in the cross-section are identified. These denote the beginning of new features which become children of the original feature. This process yields a set of six trees, each of which resembles a depth-first search tree and is a partial ordering of features within a setup. Multiple representations are investigated for those features that are accessible from more than one direction. Corresponding features in the different trees are linked by arcs, thus yielding a feature graph. The feature graph can then be used to generate optimal features for machining depending on design or manufacturing requirements such as fixtures, tolerances, corner radii, and tool accessibility. [S1087-1357(00)01901-8]
    publisherThe American Society of Mechanical Engineers (ASME)
    titleIdentification of Multiple Feature Representations by Volume Decomposition for 2.5-Dimensional Components
    typeJournal Paper
    journal volume122
    journal issue1
    journal titleJournal of Manufacturing Science and Engineering
    identifier doi10.1115/1.538905
    journal fristpage280
    journal lastpage290
    identifier eissn1528-8935
    keywordsAlgorithms
    keywordsTree (Data structure)
    keywordsManufacturing
    keywordsProduction planning
    keywordsJigs and fixtures
    keywordsCorners (Structural elements) AND Machining
    treeJournal of Manufacturing Science and Engineering:;2000:;volume( 122 ):;issue: 001
    contenttypeFulltext
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian