A Divide-and-Conquer Algorithm for Machining Feature Recognition Over Network

In this paper, a divide-and-conquer algorithm for machining feature recognition over network is presented. The algorithm consists of three steps. First, decompose the part and its stock into a number of sub-objects in the client and transfer the sub-objects to the server one by one. Meanwhile, perform machining feature recognition on each sub-object using the MCSG based approach in the server in parallel. Finally, generate the machining feature model of the part by synthesizing all the machining features including decomposed features recognized from all the sub-objects and send it back to the client. With divide-and-conquer and parallel computing, the algorithm is able to decrease the delay of transferring a complex CAD model over network and improve the capability of handling complex parts. Implementation details are included and some test results are given.Copyright © 2005 by ASME

[1]  Jami J. Shah,et al.  A Discourse on Geometric Feature Recognition From CAD Models , 2001, J. Comput. Inf. Sci. Eng..

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

[3]  Hiroshi Sakurai,et al.  Definition and Recognition of Volume Features for Process Planning , 1994 .

[4]  Yong Se Kim,et al.  Geometric reasoning for machining features using convex decomposition , 1993, Solid Modeling and Applications.

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

[6]  D. Ross.  Computer-aided design , 1961, CACM.

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

[8]  Hiroshi Sakurai,et al.  Volume decomposition and feature recognition: part 1 - polyhedral objects , 1995, Comput. Aided Des..

[9]  Satyandra K. Gupta,et al.  Towards multiprocessor feature recognition , 1997, Comput. Aided Des..

[10]  Douglas E. R. Clark,et al.  Method for finding holes and pockets that connect multiple faces in 2 1/2D objects , 1991, Comput. Aided Des..

[11]  Jami J. Shah,et al.  Feature recognition by volume decomposition using half-space partitioning , 1994 .

[12]  Hiroshi Sakurai,et al.  Volume decomposition and feature recognition, Part II: curved objects , 1996, Comput. Aided Des..

[13]  Derek Yip-Hoi,et al.  A Hybrid Approach to Feature Recognition Using Approximate and Partial Exact CAD Models , 2002, DAC 2002.

[14]  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..

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