Boundary analysis and geometric completion for recognition of interacting machining features

Abstract 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.5D features. The 3D volume generation algorithm extracts 3D portions of the part.

[1]  Xun Xu,et al.  Recognition of rough machining features in 2D components , 1998, Comput. Aided Des..

[2]  Paul K. Wright,et al.  Volumetric feature recognition for machining components with freeform surfaces , 2004, Comput. Aided Des..

[3]  Rangasami L. Kashyap,et al.  Geometric Reasoning for Extraction of Manufacturing Features in Iso-Oriented Polyhedrons , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Qiang Ji,et al.  A Dempster-Shafer approach for recognizing machine features from CAD models , 2003, Pattern Recognit..

[5]  Rangasami L. Kashyap,et al.  Geometric Reasoning for Recognition of Three-Dimensional Object Features , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Satyandra K. Gupta,et al.  Extracting alternative machining features: An algorithmic approach , 1995 .

[7]  Junghyun Han,et al.  3d geometric reasoning algorithms for feature recognition , 1996 .

[8]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.

[9]  Aristides A. G. Requicha,et al.  Spatial Reasoning for the Automatic Recognition of Machinable Features in Solid Models , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  William C. Regli,et al.  Geometric algorithms for recognition of features from solid models , 1996 .

[11]  Carlo H. Séquin,et al.  Operation decomposition for freeform surface features in process planning , 2001, Comput. Aided Des..

[12]  Jonathan Roy Corney Graph-based feature recognition , 1993 .

[13]  Douglas E. R. Clark,et al.  Delta-volume decomposition for multi-sided components , 1998, Comput. Aided Des..

[14]  Hiroshi Sakurai,et al.  Recognition of maximal features by volume decomposition , 2002, Comput. Aided Des..

[15]  Yong Se Kim,et al.  Recognition of form features using convex decomposition , 1992, Comput. Aided Des..

[16]  William C. Regli,et al.  A repository for design, process planning and assembly , 1997, Comput. Aided Des..

[17]  T. C. Chang,et al.  Graph-based heuristics for recognition of machined features from a 3D solid model , 1988 .

[18]  Y. S. Kim,et al.  Recognition of machining features for cast then machined parts , 2002, Comput. Aided Des..

[19]  Jami J. Shah,et al.  Automatic recognition of interacting machining features based on minimal condition subgraph , 1998, Comput. Aided Des..

[20]  JungHyun Han,et al.  Manufacturing feature recognition from solid models: a status report , 2000, IEEE Trans. Robotics Autom..

[21]  Daniel M. Gaines,et al.  A National Repository for Design and Process Planning , 1997 .