Lecture 9
Lecture 9
Technology, Lecture 9
Instructor: Shantanu Bhattacharya
GVMM Chair and Professor
Department of Mechanical Engineering
Indian Institute of Technology Kanpur
Email: [email protected]
Tel: 05122596056
Feature Recognition In Computer Aided Process Planning
• Capp systems usually serve as a link between CAD and CAM.
• However, it is only a partial link, because most of the existing CAD/drafting
systems do not provide part feature information, which is essential data for
CAPP.
• CAPP systems do not understand the three dimensional geometry of the
designed parts for CAD systems in terms of their engineering meaning related
to manufacturing and assembly.
• This is commonly referred to as the feature recognition problem.
• For example the object shown in the solid geometry tree given below
represents a block primitive and a cylinder primitive combined by a Boolean
operator .
• The shape and dimension of the object are
uniquely defined by this scheme.
•However, some useful higher level information
such as whether the hole is a blind hole or a
through hole is not provided.
•This kind of information, defined in terms of
feature, is essential to process planning.
Feature recognition in computer aided process
planning
• From an engineering point of view, features are
regarded as generic shapes of objects with which
engineers associate certain attributes and knowledge
useful in reasoning about or describing the products.
• A generic part feature recognition system should be
able to:
1. Extract design information of a part drawn from a
CAD database.
2. Identify all surface of the part.
3. Recognize, reason about, and interpret these
surfaces in terms of part features.
Part feature recognition approaches
• A number of approaches to part feature recognition for
rotational as well as prismatic parts have been developed such
as syntactic pattern recognition, geometry decomposition,
expert system rule logic, graph based and set rhetoric out of
which Graph based approach will be explored here.
Graph based approach:
This usually consists of three basic steps:
•STEP1: Generating graph based representation of the object to be
recognized.
•STEP2: Defining part features.
•STEP3: Matching features in the graph representation.
1. In the first step, an object is represented by graph. This step is necessary because the
data extracted from the database are usually in the form of boundary representation
and are not directly usable for feature recognition.
2. In order to recognize a feature, the information regarding the type of face adjacency
and relationships between the sets of faces should be expressed explicitly.
3. To facilitate the recognition process the AAG (attributed adjacency graph) method is
used.
Definition of Attributed Adjacency Graph
• An AAG can be defined as a graph G = (N,A,T), where N is the
set of nodes, A is the set of arcs, and T is the set of attributes
to arcs in A such that:
• For every face f in F, there exists a unique node n in N.
• For every edge e in E, there exists a unique arc a in A,
connecting nodes ni to nj corresponding to face fi and face fj
which share the common edge e.
• Every arc a in A is assigned an attribute t, where:
(1) (4)
(7) (8) (9)
(2) (3) For the purpose of inputting the
(5) (6) (14) (10) AAG graph into the computer,
we have to convert the graph
(12) (11) into the matrix form. The matrix
(13)
(15) representation of AAG is given as
follows:
(4) (1)
(5)