The Community for Technology Leaders
Green Image
<p>This paper investigates the extraction of machining features from boundary descriptions of iso-oriented (having no inclined faces) polyhedrons. We prove that manufacturing the features proposed by our feature extractor results exactly in the desired part-in this respect, the approach is both sound and complete. Our method uses the adjacency information between faces to derive the features. This keeps the determination of isolated features in a part straightforward. However, interaction of features creates difficulties since the adjacency information between some faces is lost. We derive this lost information by considering faces that when extended intersect other faces to form concave edges. The derived face adjacencies are termed virtual links. Augmenting the virtual links to the cavity graph of the object leads to its feature graph, and subgraph matching of primitive graphs in this graph results in feature hypotheses. A feature hypothesis is considered valid if the volume corresponding to it is not shared with the part in question; therefore, we verify the feature hypotheses by checking the regularized intersection of the feature volume and the part. Thus, feature verification employs a constructive solid geometry approach. We have implemented a prototype of the system in the Smalltalk-80 environment.</p>
CAD/CAM; spatial reasoning; feature extraction; graph theory; computational geometry; geometric reasoning; manufacturing feature extraction; iso-oriented polyhedrons; adjacency information; virtual links; face adjacencies; cavity graph; feature graph; subgraph matching; primitive graphs; feature hypothesis; constructive solid geometry; CAD/CAM

S. Trika and R. Kashyap, "Geometric Reasoning for Extraction of Manufacturing Features in Iso-Oriented Polyhedrons," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 16, no. , pp. 1087-1100, 1994.
89 ms
(Ver 3.3 (11022016))