COMPUTER AIDED DESIGN (CAD)

UNIT – II GEOMETRIC MODELING

Presented by
C. P. Goldin Priscilla,
AP/MECH,
Kamaraj College of Engineering and Technology,
Virudhunagar.
 UNIT – II GEOMETRIC MODELING

• Representation of curves

• Hermite Curve- Bezier curve

• B-spline curves-rational curves

• Techniques for surface modelling

• Surface patch , Coons and bicubic patches

• Bezier and B-spline surfaces

• Solid modelling techniques

• CSG and B-rep

Representation of curves
Types of Curve Equations
• Explicit (non-parametric)
Y = f(X), Z = g(X)

• Implicit (non-parametric)
f(X,Y,Z) = 0

• Parametric
X = X(t), Y = Y(t), Z = Z(t)
 Basic Concepts :

C2

C0- Zero-order parametric continuity - the two curves

sections must have the same coordinate position at the
boundary point.

C1- First-order parametric continuity - tangent lines of the

coordinate functions for two successive curve sections are
equal at their joining point.

C2- second-order parametric continuity - both the first and

second parametric derivatives of the two curve sections
are the same at the intersection,
Interpolating and approximating curve:

Convex hull
The convex hull property ensures that a parametric curve will never pass
outside of the convex hull formed by the four control vertices.

Convex hull

Interpolating spline Approximating spline

 Hermite Curve

Hermite curves are designed by using two control points and

tangent segments at each control point
Hermite Curve contd…
Hermite Curve contd…
 Hermite Curve contd…

where [MH] is the Hermite matrix and V is the geometry (or boundary
conditions) vector.
Properties:
• TheHermite curve is composed of a linear combinations of
tangents and locations (for each u)

• Alternatively, the curve is a linear combination of Hermite

basis functions (the matrix M)

• The piecewise interpolation scheme is C1 continuous

• The blending functions have local support; changing a control

point or a tangent vector, changes its local neighbourhood while
leaving the rest unchanged
Disadvantages:

Requires the specification of the tangents. This information is not

always available.

Limited to 3rd degree polynomial therefore the curve is quite stiff .

 Bezier Curve
• A Bezier Curve is obtained by a defining polygon.
• First and last points on the curve are coincident with the first and last
points of the polygon.
• Degree of polynomial is one less than the number of points
• Tangent vectors at the ends of the curve have the same directions as the
respective spans
• The curve is contained within the convex hull of the defining polygon.
Properties Bezier curve
• The Bezier curve starts at P0 and ends at Pn; this is known as ‘endpoint
interpolation’ property.

• The Bezier curve is a straight line when all the control points of a cure
are collinear.
• The beginning of the Bezier curve is tangent to the first portion of the Bezier
polygon.

• A Bezier curve can be divided at any point into two sub curves, each of which is
also a Bezier curve.

• A few curves that look like simple, such as the circle, cannot be expressed
accurately by a Bezier; via four piece cubic Bezier curve can similar a circle, with
a maximum radial error of less than one part in a thousand (Fig.1).

Fig1. Crcular Bezier curve

• Each quadratic Bezier curve is become a cubic Bezier curve, and more commonly, each
degree ‘n’ Bezier curve is also a degree ‘m’ curve for any m > n.

• Bezier curves have the different diminishing property. A Bezier curves does not ‘ripple’
more than the polygon of its control points, and may actually ‘ripple’ less than that.

• Bezier curve is similar with respect to t and (1-t). This represents that the sequence of
control points defining the curve can be changes without modify of the curve shape.

• Bezier curve shape can be edited by either modifying one or more vertices of its
polygon or by keeping the polygon unchanged or simplifying multiple coincident
points at a vertex (Fig .2).

Fig: 2. Bezier curve shpe

 B-spline Curve
• It provide local control of the curve shape.
• It also provide the ability to add control points without increasing the degree of the
curve.
• B-spline curves have the ability to interpolate or approximate a set of given data points.
The B-spline curve defined by n+1 control points Pi is given by

Ni,k(u)'s are B-spline basis functions of degree p. m = n + p + 1.

• The form of a B-spline curve is very similar to that of a Bézier curve. Unlike a Bézier
curve, a B-spline curve involves more information, namely: a set of n+1 control points, a
knot vector of m+1 knots, and a degree p.

• Given n + 1 control points P0, P1, ..., Pn and a knot vector U = { u0, u1, ..., um }, the B-
spline curve of degree p defined by these control points and knot vector.

• The knot points divide a B-spline curve into curve segments, each of which is defined
on a knot span.
 • The degree of a Bézier basis function depends on the number of control points.
• To change the shape of a B-spline curve, one can modify one or more of these
control parameters: the positions of control points, the positions of knots, and the
degree of the curve.
• If the knot vector does not have any particular structure, the generated curve will
not touch the first and last legs of the control polyline as shown in the left figure
below.
• This type of B-spline curves is called open B-spline curves.

Properties of B-Spline Curve:

The first property ensures that the relationship between the curve and its
defining control points is invariant under affine transformations.

The second property guarantees that the curve segment lies completely
within the convex hull of Pi.

The third property indicates that each segment of a B-spline

curve is influenced by only k control points or each control point affects only
only k curve segments, as shown in Figure 1.

It is useful to notice that the Bernstein polynomial,

has the same first two properties mentioned above.
The B-spline function

The B-spline function also has the property of recursion, which is defined as
 Solid modeling techniques

Constructive Solid Geometry (CSG)

Constructive solid geometry (CSG) is a method used in solid modeling for creating
3D models in CAD. Constructive solid geometry permits a modeler to make a
complex surface by applying Boolean operators to join objects. The simplest solid
objects utilized for the demonstration are called primitives. Classically they are the
items of simple shape like prisms, pyramids, spheres and cylinders.
CGS Boolean operation
CSG tree
• A CSG tree is defined as an inverted ordered binary tree
whose leaf nodes are primitives and interior nodes are
regularized set operations.

• The creation of a balanced, unbalanced, or a perfect CSG

tree depends solely on the user and how he/she decomposes
a solid into its primitives.

• The general rule to create balanced trees is to start to build

the model from an almost central position and branch out in
two opposite directions or vice versa.

• Another useful rule is that symmetric objects can lead to

perfect trees if they are decomposed properly.
A balanced tress is defines as a tree whose left and right sub trees have
almost an equal number of nodes.

A perfect tree is one whose nL-nR is equal to zero.

nL = nR = n - 1
n  number of primitives

(n-1)  number of Boolean operations

(2n-1) number of nodes

Example:
Advantages of Solid Modeling:
• Memory required will be less.
• Creation of fully valid geometrical solid model.
• Complex shapes may be developed with the available set of
primitives.
• Less skill is enough.
• Easy to construct out of primitives and Boolean operations.

Limitations of Solid Modeling:

• New computational effort and time are essential wherever
the model is to be shown in the screen.
• Getting fillet, chamfer and taper in the model is very
difficult.
 Boundary Representation ( B- rep)
• Boundary representation is one of the two most popular and widely used schemes to
create solid models of physical objects.

• A B-rep model or boundary model is based on the topological notion that a physical
object is bounded by a set of faces.

• These faces are regions or subsets of closed and orientable surfaces.

• A closed surface is one that is continuous without breaks.

• An orientable surface is one in which it is possible to distinguish two sides by using the
direction of the surface normal to point to the inside or outside of the solid model under
construction.

• Each face is bounded by edges and each edge is bounded by vertices.

• Thus, topologically, a boundary model of an object is comprised of faces, edges, and

vertices of the object linked together in such a way as to ensure the topological
consistency of the model.
Vertex (V) : It is a unique point (an ordered triplet) in space

Edge (E): It is finite, non-self intersecting, directed space c urve bounded by t wo vertices that
are not necessarily distinct

Face (F) : It is defined as a finite connected, non-self-intersecting, region of a closed oriented

surface bounded by one or mor e loops

Loop (L) : It is an ordered alternating sequence of vertices and edges

Genus (G) : It is the topological name for the number of handles or through holes in an object

Body/Shell(B) : It is a set of faces that bound a single connected c losed volume. A m inimum
body is a point
Data Structure of B-rep
Advantages of B-rep:
1. It is traditionally a popular modeling method related closely to
traditional drafting.
2. It is very suitable tool to build quite extraordinary shapes like
aircraft and automobiles,
that are difficult to build using primitives .
3. It is comparatively simple to convert a B-rep model into a
wireframe model because its boundary
deception is similar to the wireframe definitions.
4. In applications B-rep algorithms are reliable and competitive to
CSG based algorithms .

Limitations of B-Rep:
1. It requires large storage memory space as it stores the explicit
definitions of the model boundaries.
2. Sometimes geometrically valid solids are not possible.
3. Approximate B-rep is not suitable for manufacturing applications.
Thank You