MECHANICAL ENGINEERING

DEPARTMENT
SUBMITTED BY:
11503312 – KUSHAL
SUBMITTED TO: SIDHU
SIMRANJEET SINGH 11503313 – LAKHMI
CHAND
SIDHU 11503314 – MOHIT
KHOSLA
11503316 – RAJ KUMAR
 FREE FORM CURVES

 PRIMITIVE POLYNOMIALS

 CONTROLPOINTS FOR SHAPE

MANUPLATION
 Freeform surface modelling is a technique for
engineering Freeform Surfaces with a Computer-
aided design OR Computer-aided industrial
design system.
 The technology has encompassed two main
fields. Either creating aesthetic Class_A_surfaces
that also perform a function; for example, car
bodies and consumer product outer forms, or
technical surfaces for components such as gas
turbine blades and other fluid dynamic
engineering components.
 CAD software packages use two basic
methods for the creation of
Computer_representation_of_surfaces.
 The first begins with construction curves
Spline_(mathematics) from which the 3D
surface is then swept (section along guide
rail) or meshed (lofted) through.
 CATIA
 Key Creator
 Tebis
 Form-Z
 Power SHAPE
 Solid works
 ProEngineer
 NX
 Various different representations of 3D freeform
curves and surfaces are in use. Curves may be
represented by using different kinds of
equations. In particular, we distinguish the
following representations .
 1. explicit or Cartesian, where the curve is given
as the graph of a function;
 2. implicit, as the zero set of one or more global
algebraic equations;
 3. parametric, associated with a vector function
of one parameter;
 4. intrinsic, where points locally satisfy
differential equations.
1.BEIZER CURVE

Fig: A cubic (degree 3) B´ezier curve

FIG: B´ezier patch
2.B-SPLINE CURVE

Fig: A B-spline curve with 8 control

points
3. NURBS CURVE

Fig: A NURBS curve with 6 control

points.
1. In field theory, a branch of mathematics, a
primitive polynomial is the minimal
polynomial of a primitive element of the finite
extension field GF(p m ). In other words, a
polynomial F(X) with coefficients in GF(p) =
Z/pZ is a primitive polynomial if it has a root
α in GF(p m ) such that is the entire field GF(p
m ), and moreover, F(X) is the smallest degree
polynomial having α as root.
 2.In ring theory, the term primitive
polynomial is used for a different purpose, to
mean a polynomial over an integral domain R
(such as the integers) such that no non-
invertible element of R divides all its
coefficients at once. This article will not be
concerned with the ring theory usage. See
Gauss's lemma.
 A primitive polynomial must have a non-zero
constant term, for otherwise it will be
divisible by x. Over the field of two elements,
x+1 is a primitive polynomial and all other
primitive polynomials have an odd number of
terms, since any polynomial mod 2 with an
even number of terms is divisible by x+1.
 An irreducible polynomial of degree m, F(x)
over GF(p) for prime p, is a primitive
polynomial if the smallest positive integer n
such that F(x) divides x n - 1 is n = p m − 1.
 Over GF(pm ) there are exactly φ(pm − 1)/m
primitive polynomials of degree m, where φ is
Euler's totient function.

 The roots of a primitive polynomial all have

order p m − 1.
 The cyclic redundancy check (CRC) is an error-
detection code that operates by interpreting the
message bitstring as the coefficients of a
polynomial over GF(2) and dividing it by a fixed
generator polynomial also over GF(2); see
Mathematics of CRC. Primitive polynomials, or
multiples of them, are a good choice for
generator polynomials because they can reliably
detect two bit errors that occur far apart in the
message bitstring, up to a distance of 2n - 1 for
a degree n primitive polynomial
 As shown in the examples above, only linear
polynomials are irreducible over the field of
complex numbers (this is a consequence of
the fundamental theorem of algebra). Since
the complex roots of a real polynomial are in
conjugate pairs, the irreducible polynomials
over the field of real numbers are the linear
polynomials and the quadratic polynomials
with no real roots. For example, x 4 + 1
factors over the real numbers as (x +√2x+1)
(x -√2x+1). 2 2
 Factorization over a finite field behaves similarly
to factorization over the rational or the complex
field. However, polynomials with integer
coefficients that are irreducible over the field can
be reducible over a finite field. For example, the
polynomial x 2 + 1 is irreducible over but
reducible over the field of two elements. Indeed,
over , we have (x 2 + 1) = (x + 1)2 The
irreducibility of a polynomial over the integers is
related to that over the field of p elements (for a
prime p). Namely, if a polynomial over with
leading coefficient 1 is reducible over then it is
reducible over for any prime p. The converse,
however, is not true.