Lecture-5 DM_4th Slide 17.2.25
Lecture-5 DM_4th Slide 17.2.25
ME6L320
Dr. Madhusmita
Introduction
L1 L1
P
L2 C1 R P L2 C1 R
L3 L3
L1 L1
R P
L2 P R L2
C1 C1
L3 L3
Steps in FBA: Create shapes (2D-sketch), create features and combine features.
Common primitives
• Primitives are considered building blocks.
• Planes, cylinders, cones and spheres are the most commonly used
primitives.
• The validity of the resulting solid are achieved via Boolean operations.
• The shape of solid model is invariant and does not depend on the model’s
location or its orientation in space.
• The size of solid should be finite and limited amount of information can
describe the solid.
Wire frame modelling
•• This
Thismethod
methodisisperhaps
perhapsone
oneofofthe
theoldest
oldesttotorepresent solids.
represent solids.
• Two tables are generated for data storage, one storing topology
(connectivity) and other the geometry.
• For curved edges, the control points, slopes and knot vector may be stored
depending on the Ferguson, Bezier or B-spline segments modeled.
Edge number
Tetrahedron wireframe
Solid 1
Solid 2
Wireframe
Wireframe
Handle, H Face , F
v An loop is a hole in a face.
2D Hole
Nonsense object
Original object
Modified object
• Objects that are often encountered in engineering can be classified as
either polyhedral or curved objects.
Simple polyhedra which do not have holes Polyhedra with faces of inner
loops
Boundary hole
V=8 B=1 =2
Topologically is valid
F = 14 L=2 F-E+V-L = 14-36+24-2
=0
V = 24 B=1
2 (B-G) = 2 (1-1)
E = 36 G=1
=0
Virtual edges
V=2 B=1 =2
2 (B-G) = 2 (1-0)
E=3 G=0
=2
Constructive solid geometry (CSG)
• A CSG model is based on the notion that physical object can be divided into
a set of primitives.
• The validity check of the resulting model is dependent upon the validity
check of the used primitives.
• These checks are simple and are in the form of greater than zero.
For example
If the dimensions of a block are greater than zero and the radius and length of
a cylinder are also greater than zero, combining them produces a valid solid.
CSG Trees
• A CSG tree is defined as an inverted, ordered binary tree whose leaf nodes
are primitives and interior nodes are regularized set operations.
• Inverted means that the tree is upside down, its root is on the top.
• Ordered means that each tree node has a left branch or a right branch.
• Binary means that each tree node has only two branches going into it.
If a solid has n primitives, then there are (n-1) Boolean operations for a total
of (2n-1) nodes in a CSG tree.
OP OP
CSG tree with eight primitives (P 1 to P8)
3 6
Seven Boolean operators (OP 1 to OP7)
P8
OP OP
2 P6
5
P5 P7
OP OP
1 4
P1 P3 P4 P2
In practice the leaf nodes
are shown as primitives
names without circle
CSG tree of a solid
Other style of showing a CSG tree may replace primitive names by their
sketches.
Final Object
Set operation
Transformation
Cylindrical Block
primitive primitive
Example of CSG tree
Application of CSG tree
The designer can walk up and down the tree by clicking any of its leaves.
Allowing the designer to change/modify any values and re-create the feature.
The designer can move the entire tree branch to a new location up or down
the tree, or can delete the entire branch
Thank You