4.7 Article

Boundary analysis and geometric completion for recognition of interacting machining features

期刊

COMPUTER-AIDED DESIGN
卷 38, 期 8, 页码 845-856

出版社

ELSEVIER SCI LTD
DOI: 10.1016/j.cad.2006.04.015

关键词

feature recognition; CAPP; graph decomposition; geometric completion

向作者/读者索取更多资源

Features are the basic elements which transform CAD data into instructions necessary for automatic generation of manufacturing process plans. In this paper, a hybrid of graph-based and hint-based techniques is proposed to automatically extract interacting features from solid models. The graph-based hints generated by this approach are in geometrical and topological compliance with their corresponding features. They indicate whether the feature is 2.5D, floorless or 3D. To reduce the product model complexity while extracting features, a method to remove fillets existing in the boundary of a 2.5D feature is also proposed. Finally, three geometric completion algorithms, namely, Base-Completion, Profile-Completion and 3D-volume generation algorithms are proposed to generate feature volumes. The base-completion and profile-completion algorithms generate maximal volumes for 2.5Dfeatures. The 3D volume generation algorithm extracts 3D portions of the part. (c) 2006 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据