Scribd
Upload
87 views7 pages

Terna Engineering College: LAB Manual Part A

The document describes Experiment No. 08 on implementing a Bezier curve using n control points. It provides the aim, prerequisites, and expected outcome of the experiment. The document then gives the theory behind Bezier curves, describing them mathematically and explaining that they can be determined by control points. It provides the basic algorithm to find points to generate the curve through iterations. The document is divided into parts for the lab manual and for students to document their observations, conclusions, and answer questions.

Uploaded by

Prathmesh Gaikwad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
87 views7 pages

Terna Engineering College: LAB Manual Part A

The document describes Experiment No. 08 on implementing a Bezier curve using n control points. It provides the aim, prerequisites, and expected outcome of the experiment. The document then gives the theory behind Bezier curves, describing them mathematically and explaining that they can be determined by control points. It provides the basic algorithm to find points to generate the curve through iterations. The document is divided into parts for the lab manual and for students to document their observations, conclusions, and answer questions.

Uploaded by

Prathmesh Gaikwad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Terna Engineering College

Computer Engineering Department


Program: Sem IV

Course: Computer Graphics

Faculty:
LAB Manual

PART A
(PART A : TO BE REFFERED BY STUDENTS)

Experiment No.08
A.1 Aim:
Implement Bezier Curve using n Control Points.

A.2 Prerequisite:
1. C Language.
2. Geometric Concepts.
3. Curve Generation.

A.3 Outcome:
After successful completion of this experiment students will be able to,

Implementation of curve and fractal generation.

A.4 Theory:
Bezier curve is discovered by the French engineer Pierre Bézier. These curves can be
generated under the control of other points. Approximate tangents by using control
points are used to generate curve. The Bezier curve can be represented mathematically
as −

∑k=0nPiBni(t)∑k=0nPiBin(t)
Where pipi is the set of points and Bni(t)Bin(t) represents the Bernstein polynomials
which are given by −
Bni(t)=(ni)(1−t)n−itiBin(t)=(ni)(1−t)n−iti

Where n is the polynomial degree, i is the index, and t is the variable.

The simplest Bézier curve is the straight line from the point P0P0 to P1P1. A quadratic
Bezier curve is determined by three control points. A cubic Bezier curve is determined
by four control points.

A.5 Procedure:

Basic Algorithm
The objective here is to find points in the middle of two nearby points and iterate this
until we have no more iterations. The new values of points will give us the curve. The
famous Bezier equation is the exact formulation of this idea. Here is the algorithm:
Step 1: Select a value t Î [0,1]. This value remains constant for the rest of the steps.
Step 2: Set Pi[0] (t) = Pi, for i = 0,...,n.
Step 3: For j= 0,...,n, set for i = j,...,n.
Step 4: g (t) = Pn[n] (t)
PART B
(PART B : TO BE COMPLETED BY STUDENTS)

(Students must submit the soft copy as per following segments within two hours of the practical.
The soft copy must be uploaded on the Blackboard or emailed to the concerned lab in charge
faculties at the end of the practical in case the there is no Black board access available)

Roll No. C28 Name: Prathmesh Krishna Gaikwad


Class : SE-C Batch : B-1
Date of Experiment: 17/11/2021 Date of Submission: 17/11/2021
Grade :
B.1 Document created by the student:

B.3 Observations and learning:

Ans- We learned about beizer curve and fractal generation.

B.4 Conclusion:

Ans- Hence, we have successfully learned to apply Bezier Curve using n Control
Points implements in C.

B.5 Question of Curiosity


Q.1] Explain the properties of Bezier Curve.

Ans-

Bezier curves have the following properties −


⚫ They generally follow the shape of the control polygon, which consists of the segments joining the control
points.
⚫ They always pass through the first and last control points.
⚫ They are contained in the convex hull of their defining control points.
⚫ The degree of the polynomial defining the curve segment is one less that the number of defining polygon
point. Therefore, for 4 control points, the degree of the polynomial is 3, i.e. cubic polynomial.
⚫ A Bezier curve generally follows the shape of the defining polygon.
⚫ The direction of the tangent vector at the end points is same as that of the vector determined by first and
last segments.
⚫ The convex hull property for a Bezier curve ensures that the polynomial smoothly follows the control points.
⚫ No straight line intersects a Bezier curve more times than it intersects its control polygon.
⚫ They are invariant under an affine transformation.
⚫ Bezier curves exhibit global control means moving a control point alters the shape of the whole curve.
⚫ A given Bezier curve can be subdivided at a point t=t0 into two Bezier segments which join together at the
point corresponding to the parameter value t=t0.

Q.2] Write the advantages and disadvantages of Bezier Curve.

Ans-

ADVANTAGES: The benefit of Bezier curves is the ease of computation, stability at the
lower degrees of control points (warning! they do become unstable at higher degrees)
and a Bezier curve can be rotated and translated by performing the operations on the
points. See Paul Bourke's site for more properties of Bezier curves.

DISADVANTAGES: Meshes are large, difficult to edit, require normal approximations,


… Parametric instancing has a limited domain of shapes. CSG is difficult to render and
limited in range of shapes. Implicit models are difficult to control and render.

Q.3] Name the types of Bezier Curve.

Ans- The term Bézier curve actually refers to a family of similar curves. SkiaSharp
supports three types of Bézier curves, called the cubic, the quadratic, and the conic.
Q.4] Implement Bezier Curve for n control points.

Ans-
OUTRPUT:
************************

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy