0% found this document useful (0 votes)
9 views

Computer Graphics Curve1

The document discusses different types of curves in computer graphics, categorizing them into explicit, implicit, and parametric curves. It explains implicit curves defined by functions like f(x, y) = 0, explicit curves as y = f(x), and parametric curves represented as P(t) = f(t), g(t). Additionally, it covers Bezier curves, which are controlled by points, and B-spline curves that provide more flexibility through linear combinations of control points and basis functions.

Uploaded by

Rabia Riaz
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views

Computer Graphics Curve1

The document discusses different types of curves in computer graphics, categorizing them into explicit, implicit, and parametric curves. It explains implicit curves defined by functions like f(x, y) = 0, explicit curves as y = f(x), and parametric curves represented as P(t) = f(t), g(t). Additionally, it covers Bezier curves, which are controlled by points, and B-spline curves that provide more flexibility through linear combinations of control points and basis functions.

Uploaded by

Rabia Riaz
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Computer Graphics Curves

Types of Curves
A curve is an infinitely large set of points. Each point has two neighbors except endpoints.
Curves can be broadly classified into three categories − explicit, implicit, and parametric
curves.

Implicit Curves
Implicit curve representations define the set of points on a curve by employing a procedure that
can test to see if a point in on the curve. Usually, an implicit curve is defined by an implicit
function of the form −
f(x, y) = 0
It can represent multivalued curves (multiple y values for an x value). A common example is the
circle, whose implicit representation is

x2 + y2 - R2 = 0

Explicit Curves
A mathematical function y = f(x) can be plotted as a curve. Such a function is the explicit
representation of the curve. The explicit representation is not general, since it cannot represent
vertical lines and is also single-valued. For each value of x, only a single value of y is normally
computed by the function.
Parametric Curves
Curves having parametric form are called parametric curves. The explicit and implicit curve
representations can be used only when the function is known. In practice the parametric curves
are used. A two-dimensional parametric curve has the following form −
P(t) = f(t), g(t) or P(t) = x(t), y(t)
The functions f and g become the (x, y) coordinates of any point on the curve, and the points are
obtained when the parameter t is varied over a certain interval [a, b], normally [0, 1].
Bezier Curves

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 −

$$\sum_{k=0}^{n} P_{i}{B_{i}^{n}}(t)$$

Where $p_{i}$ is the set of points and ${B_{i}^{n}}(t)$ represents the Bernstein polynomials
which are given by −

$${B_{i}^{n}}(t) = \binom{n}{i} (1 - t)^{n-i}t^{i}$$

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 $P_{0}$ to $P_{1}$. A quadratic
Bezier curve is determined by three control points. A cubic Bezier curve is determined by four
control points.

B-Spline Curves
The Bezier-curve produced by the Bernstein basis function has limited flexibility.

A B-spline curve is defined as a linear combination of control points Pi and B-spline basis
function $N_{i,}$ k (t) given by

$C(t) = \sum_{i=0}^{n}P_{i}N_{i,k}(t),$ $n\geq k-1,$ $t\: \epsilon \: [ tk-1,tn+1 ]$

$${t_{i}:i = 0, ... n + K}$$

The Ni, k functions are described as follows −

$$N_{i,1}(t) = \left\{\begin{matrix} 1,& if \:u \: \epsilon \: [t_{i,}t_{i+1}) \\ 0,& Otherwise


\end{matrix}\right.$$

and if k > 1,

$$N_{i,k}(t) = \frac{t-t_{i}}{t_{i+k-1}} N_{i,k-1}(t) + \frac{t_{i+k}-t}{t_{i+k} - t_{i+1}}


N_{i+1,k-1}(t)$$

and

$$t \: \epsilon \: [t_{k-1},t_{n+1})$$

You might also like