YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASME
    • Journal of Computing and Information Science in Engineering
    • View Item
    •   YE&T Library
    • ASME
    • Journal of Computing and Information Science in 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

    Feature Edge Extraction Via Angle-Based Edge Collapsing and Recovery

    Source: Journal of Computing and Information Science in Engineering:;2018:;volume( 018 ):;issue: 002::page 21001
    Author:
    Yamakawa, Soji
    ,
    Shimada, Kenji
    DOI: 10.1115/1.4037227
    Publisher: The American Society of Mechanical Engineers (ASME)
    Abstract: This paper presents a new method for extracting feature edges from computer-aided design (CAD)-generated triangulations. The major advantage of this method is that it tends to extract feature edges along the centroids of the fillets rather than along the edges where fillets are connected to nonfillet surfaces. Typical industrial models include very small-radius fillets between relatively large surfaces. While some of those fillets are necessary for certain types of analyses, many of them are irrelevant for many other types of applications. Narrow fillets are unnecessary details for those applications and cause numerous problems in the downstream processes. One solution to the small-radius fillet problem is to divide the fillets along the centroid and then merge each fragment of the fillet with nonfillet surfaces. The proposed method can find such fillet centroids and can substantially reduce the adverse effects of such small-radius fillets. The method takes a triangulated geometry as input and first simplifies the model so that small-radius, or “small,” fillets are collapsed into line segments. The simplification is based on the normal errors and therefore is scale-independent. It is particularly effective for a shape that is a mix of small and large features. Then, the method creates segmentation in the simplified geometry, which is then transformed back to the original shape while maintaining the segmentation information. The groups of triangles are expanded by applying a region-growing technique to cover all triangles. The feature edges are finally extracted along the boundaries between the groups of triangles.
    • Download: (9.992Mb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Price: 5000 Rial
    • Statistics

      Feature Edge Extraction Via Angle-Based Edge Collapsing and Recovery

    URI
    http://yetl.yabesh.ir/yetl1/handle/yetl/4253849
    Collections
    • Journal of Computing and Information Science in Engineering

    Show full item record

    contributor authorYamakawa, Soji
    contributor authorShimada, Kenji
    date accessioned2019-02-28T11:12:33Z
    date available2019-02-28T11:12:33Z
    date copyright1/31/2018 12:00:00 AM
    date issued2018
    identifier issn1530-9827
    identifier otherjcise_018_02_021001.pdf
    identifier urihttp://yetl.yabesh.ir/yetl1/handle/yetl/4253849
    description abstractThis paper presents a new method for extracting feature edges from computer-aided design (CAD)-generated triangulations. The major advantage of this method is that it tends to extract feature edges along the centroids of the fillets rather than along the edges where fillets are connected to nonfillet surfaces. Typical industrial models include very small-radius fillets between relatively large surfaces. While some of those fillets are necessary for certain types of analyses, many of them are irrelevant for many other types of applications. Narrow fillets are unnecessary details for those applications and cause numerous problems in the downstream processes. One solution to the small-radius fillet problem is to divide the fillets along the centroid and then merge each fragment of the fillet with nonfillet surfaces. The proposed method can find such fillet centroids and can substantially reduce the adverse effects of such small-radius fillets. The method takes a triangulated geometry as input and first simplifies the model so that small-radius, or “small,” fillets are collapsed into line segments. The simplification is based on the normal errors and therefore is scale-independent. It is particularly effective for a shape that is a mix of small and large features. Then, the method creates segmentation in the simplified geometry, which is then transformed back to the original shape while maintaining the segmentation information. The groups of triangles are expanded by applying a region-growing technique to cover all triangles. The feature edges are finally extracted along the boundaries between the groups of triangles.
    publisherThe American Society of Mechanical Engineers (ASME)
    titleFeature Edge Extraction Via Angle-Based Edge Collapsing and Recovery
    typeJournal Paper
    journal volume18
    journal issue2
    journal titleJournal of Computing and Information Science in Engineering
    identifier doi10.1115/1.4037227
    journal fristpage21001
    journal lastpage021001-18
    treeJournal of Computing and Information Science in Engineering:;2018:;volume( 018 ):;issue: 002
    contenttypeFulltext
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian