3-D OBJECT REPRESENTATION

Polygon Surfaces
Objects are represented as a collection of surfaces. 3D object representation is divided into two
categories.

 Boundary Representations (B-reps) − It describes a 3D object as a set of surfaces that

separates the object interior from the environment.
 Space partitioning representations − It is used to describe interior properties, by partitioning
the spatial region containing an object into a set of small, non-overlapping, contiguous solids
(usually cubes).

The most commonly used boundary representation for a 3D graphics object is a set of surface
polygons that enclose the object interior. Many graphics system use this method. Set of polygons
are stored for object description. This simplifies and speeds up the surface rendering and display
of object since all surfaces can be described with linear equations.

The polygon surfaces are common in design and solid-modeling applications, since
their wireframe display can be done quickly to give general indication of surface structure.
Then realistic scenes are produced by interpolating shading patterns across polygon surface to
illuminate.

Polygon Tables
In this method, the surface is specified by the set of vertex coordinates and associated attributes.
As shown in the following figure, there are five vertices, from v1 to v5.
 Each vertex stores x, y, and z coordinate information which is represented in the table as v 1: x1,
y1, z1
 The Edge table is used to store the edge information of polygon. In the following figure, edge
E1 lies between vertex v1 and v2 which is represented in the table as E1: v1, v2.
 Polygon surface table stores the number of surfaces present in the polygon. From the following
figure, surface S1 is covered by edges E1, E2 and E3 which can be represented in the polygon
surface table as S1: E1, E2 and E3
Plane Equations

The equation for plane surface can be expressed as −

Ax + By + Cz + D = 0

Where (x, y, z) is any point on the plane, and the coefficients A, B, C, and D are constants
describing the spatial properties of the plane. We can obtain the values of A, B, C, and D by
solving a set of three plane equations using the coordinate values for three non collinear points in
the plane. Let us assume that three vertices of the plane are (x1, y1, z1), (x2, y2, z2) and (x3, y3, z3).

Let us solve the following simultaneous equations for ratios A/D, B/D, and C/D. You get the
values of A, B, C, and D.
 (A/D) x1 + (B/D) y1 + (C/D) z1 = -1
(A/D) x2 + (B/D) y2 + (C/D) z2 = -1
(A/D) x3 + (B/D) y3 + (C/D) z3 = -1

To obtain the above equations in determinant form, apply Cramers rule to the above equations.

 Ax + By + Cz + D ≠ 0 means the point is not on the plane.

 Ax &plus; By &plus; Cz &plus; D < 0 means the point is inside the surface.
 Ax &plus; By &plus; Cz &plus; D > 0 means the point is outside the surface.

Quadric surfaces are three-dimensional shapes like ellipsoids, hyperboloids, or

paraboloids, described by second-degree equations in three variables. These surfaces
have have wide-ranging applications in fields such as physics, engineering, and computer
graphics.

What are Quadric Surfaces?

Quadric surfaces, defined by second-degree polynomial equations in three variables,
encompass diverse three-dimensional shapes like ellipsoids, spheres, cylinders, cones,
paraboloids, and hyperboloids.
Quadric surfaces

Each shape exhibits distinct symmetrical properties and curvature characteristics.

 Ellipsoids resemble stretched or squished spheres, while spheres possess
perfect symmetry.
 Cylinders manifest as tube-like structures, and cones feature pointed tips and circular or
hyperbolic bases.
 Paraboloids display either elliptic or hyperbolic curvature, while hyperboloids exhibit
separate or connected pieces.
Widely used in mathematics, engineering, and computer graphics, quadric surfaces serve as
models for real-world objects, from geometric forms to complex structures like antennas and
satellite dishes, owing to their mathematical elegance and versatility.

Definition of Quadratic Surface

A quadratic surface is a three-dimensional shape described by an equation of the form Ax² +
By² + Cz² + 2Dxy + 2Exz + 2Fyz + 2Gx + 2Hy + 2Iz + J = 0, where A, B, C, D, E, F, G, H, I,
and J are constants.
These surfaces encompass various shapes like ellipsoids, spheres, cylinders, cones,
paraboloids, and hyperboloids. They exhibit symmetrical properties and curvature, making
them vital in fields like mathematics, engineering, and computer graphics for modeling real-
world objects and phenomena.

Applications of Quadric Surfaces

Quadric surfaces have numerous applications across various fields due to their geometric
properties and versatility:
In Optics and Engineering
 Paraboloids: Used in satellite dishes and telescopes for focusing incoming electromagnetic
waves (such as light or radio waves) to a single point, due to their reflective properties.
 Ellipsoids: Describe the shapes of lenses and mirrors in optics, where they help control the
path of light rays.
In Architecture and Design
 Ellipsoids: Often used in architectural design to create aesthetically pleasing shapes for
buildings, domes, and structural elements.
 Hyperboloids: Employed in the design of iconic structures like cooling towers and bridges
due to their structural strength and unique shape.
In Physics and Mechanics
 Elliptic Cylinders: Describe the shape of pressure vessels and pipes in fluid mechanics,
where the cross-section remains constant along the length.
 Parabolic Cylinders: Used in mechanics to model trajectories of particles or projectiles
under certain forces, due to their parabolic cross-sections.
Computer Graphics and Animation
 Quadric surfaces are used extensively in computer graphics to model objects in 3D scenes
due to their mathematical simplicity and ability to represent a wide variety of shapes.
Mathematical Modeling
 Elliptic Paraboloids and Hyperbolic Paraboloids: Used in mathematical modeling and
optimization problems where these surfaces represent constraints or objective functions.
Hermite Curve

A Hermite curve is a type of parametric cubic curve widely used in computer graphics,
animation, geometric modeling, and CAD systems to smoothly interpolate between two given
points.
Unlike Bézier or B-spline curves, Hermite curves are defined not only by their endpoints but
also by the tangents (slopes) at those points, giving precise control over the curve’s shape.

Characteristics

Property Description

Endpoints The curve starts at P0 and ends at P1

Tangents R0 controls the starting slope; R1controls the ending slope.

Continuity C1 (first derivative is continuous).

Local control Changing one tangent affects only the nearby region of the curve.
Applications
 Animation paths: Smooth transitions between keyframes.
 Camera movement: Smooth camera trajectories in games or films.
 Geometric modeling: Designing surfaces and smooth shapes.
 Interpolation: Smoothly interpolate data points or positions.
Advantages
 Hermite curves are easily calculatable.
 They are used to smoothly interpolate through control points.
 Understanding the mathematical background of Hermite curves will help us to
understand the entire family of splines.
Disadvantages

 First-order derivatives are required; it is not suitable for a designer to provide first-order
derivatives.
 There is no local control support.
 The order of the curve is constant in spite of the number of data points.

Bezier curve
Bezier curves are parametric curves that can be fitted to any number of control points. These
control points are used to shape the curve and determine its degree. The degree of a Bezier curve
is always one less than the number of control points.

For example, if there are three control points, the Bezier curve will be of degree two; if there are
four control points, the curve will be of degree three, and so on.

The quadratic (degree 2) Bezier curve is like with three control points −

The cubic Bezier curve is like −

Example

The Bezier curve equation is defined using a blending function. This blending function helps
combine the control points to form the curve. A Bezier curve can be represented as −
So we will calculate curve x and y pixel by incrementing value of u by 0.0001.

Construction of a cubic Bézier curve

Properties of Bezier curves

1. They always pass through the first and last control points.
2. They are contained in the convex hull of their defining control points.
3. The degree of the polynomial defining the curve segment is one less than the number of
defining polygon point. Therefore, for 4 control points, the degree of the polynomial is 3, i.e.
cubic polynomial.
4. A Bezier curve generally follows the shape of the defining polygon
5. The direction of the tangent vector at the endpoints is the same as that of the vector
determined by the first and last segments.
6. Bezier curves exhibit global control means moving a control point alters the shape of the
whole curve

Drawbacks of Bezier curve :

a) The degree of Bezier curve depends upon the number of control points associated with the
corresponding curve, as the number of control points increases the polynomial degree of the
curve equation also increases that make the curve equation very complex and harder to deal
with.
Degree of curve = no. of control points - 1
 b) One major disadvantage of using the Bezier curve is that they impart global control to the
curve. Which means if the relative position of the curve changes the whole curve shape get
changes. This makes it less convenient to use.

On changing any one of the control points relative position the whole curve shape get changes:

c) One more problem with Bezier is that its blending function never gets zero for any
parameter irrespective of the degree of the curve.

B-Spline Curve
A B-Spline curve, short for Basis Spline, is a smooth curve defined by a set of control points.
The curve does not necessarily pass through these control points but is influenced by their
positions. This allows for more control and flexibility when designing curves in computer
graphics.

Concept of B-spline curve came to resolve the disadvantages having by Bezier curve, as we all
know that both curves are parametric in nature. In Bezier curve we face a problem, when we
change any of the control point respective location the whole curve shape gets change. But here
in B-spline curve, the only a specific segment of the curve-shape gets changes or affected by the
changing of the corresponding location of the control points.

In the B-spline curve, the control points impart local control over the curve-shape rather than the
global control like Bezier-curve.

B-spline curve shape before changing the position of control point P1 -

B-spline curve shape after changing the position of control point P1 -

You can see in the above figure that only the segment-1st shape as we have only changed the
control point P1, and the shape of segment-2nd remains intact.

B-spline Curve :
As we see above that the B-splines curves are independent of the number of control points and
made up of joining the several segments smoothly, where each segment shape is decided by
some specific control points that come in that region of segment. Consider a curve given below -

Attributes of this curve are -

 We have "n+1" control points in the above, so, n+1=8, so n=7.
 Let's assume that the order of this curve is 'k', so the curve that we get will be of a polynomial
degree of "k-1". Conventionally it's said that the value of 'k' must be in the range: 2 ≤ k ≤
n+1. So, let us assume k=4, so the curve degree will be k-1 = 3.
 The total number of segments for this curve will be calculated through the following formula
-
Total no. of seg = n - k + 2 = 7 – 4 + 2 = 5.
Segment
s Control points Parameter

S0 P0,P1,P2,P3 0≤t≤2

S1 P1,P2,P3,P4 2≤t≤3

S2 P2,P3,P4,P5 3≤t≤4

S3 P3,P4,P5,P6 4≤t≤5

S4 P4,P5,P6,P7 5≤t≤6

Knots in B-spline Curve :

The point between two segments of a curve that joins each other such points are known as knots
in B-spline curve. In the case of the cubic polynomial degree curve, the knots are "n+4". But in
other common cases, we have "n+k+1" knots. So, for the above curve, the total knots vectors
will be –

Total knots = n+k+1 = 7 + 4 + 1 = 12

These knot vectors could be of three types -
 Uniform (periodic)
 Open-Uniform
 Non-Uniform

B-spline Curve Equation : The equation of the spline-curve is as follows -

 Some cases of Basis function :

Properties of B-spline Curve :

 Each basis function has 0 or +ve value for all parameters.
 Each basis function has one maximum value except for k=1.
 The degree of B-spline curve polynomial does not depend on the number of control points
which makes it more reliable to use than Bezier curve.
 B-spline curve provides the local control through control points over each segment of the
curve.
 The sum of basis functions for a given parameter is one.

Difference between Spline, B-Spline and Bezier Curves



Spline, B-Spline and Bezier Curves are all methods used for creating smooth curves in computer
graphics, geometry, and data fitting, but they differ in terms of construction, flexibility, and
control over the shape of the curve.
Key differences between them are:
Feature Spline B-Spline Bezier Curves

A generalization of
A piecewise polynomial A parametric curve
Bezier curves with
curve used to interpolate defined by control
local control over
or approximate points points
Definition segments

Flexible, can interpolate Local control; changes Global control; all

or approximate given affect only part of the control points affect
Control Points points curve the entire curve

Fixed degree,
Degree increases with
Varies depending on the independent of the
the number of control
polynomial used number of control
points
Degree points

Continuity between
Ensures smooth Entire curve is a single
segments, with control
transitions between polynomial with G¹
over degree of
segments (C² continuity) continuity
Continuity smoothness

Limited local control; No; all control points

Yes, local control over
changing a point can influence the whole
small parts of the curve
Local Control affect the entire curve curve

Represented as a
Represented using a
weighted sum of
Represented by a series combination of basis
control points
of polynomial functions functions and control
Curve (Bernstein
points
Representation polynomials)

Uses a knot vector to No knot vector;

Not explicitly used define segment defined only by control
Knot Vector boundaries points

Higher, due to basis

Lower, especially for
Computation Moderate functions and knot
low-degree curves
Complexity vectors
 Feature Spline B-Spline Bezier Curves

Highly flexible with Less flexible; difficult

Good for fitting curves
local control and non- to control with many
to given data points
Flexibility uniform knot spacing control points

Data interpolation, CAD, 3D modeling, CAD, Graphic design,

Applications scientific computing animation paths animation, font design

Approximation or Precise control over Simple and intuitive

interpolation of large complex shapes and curve design with few
Best For datasets surfaces control points

Bezier Surfaces

Just as Bezier curves are used to create smooth lines, Bezier surfaces are used to create smooth
surfaces in 3D graphics. A Bezier surface is defined by a grid of control points, and the surface is
shaped according to these points. Bezier surfaces are widely used in 3D modelling and CAD
software to create smooth, organic shapes.

Equation for the Bezier surface is quite similar to the curve −

P(u,v)=∑i=0n∑j=0mpi,jBEZi,n(u)BEZj,m(v),0≤u,v≤1
 Where,

 pi,j represents the control points.

 BEZi,n(u) and BEZj,m(v) are the blending function.
 u,v are parameters that varies between 0 and 1, controlling the position along the curve.
 BEZi,n(u)=C(n,i)ui(1−u)n−i
 BEZj,m(v)=C(m,j)vj(1−v)m−j
Properties of Bezier Surfaces
Bezier surfaces share many of the same properties as Bezier curves, including −

 They pass through the first and last control points.

 The surface lies within the convex hull of the control points.
 The blending functions used to define the surface are positive.

Bezier surfaces are especially useful for designing complex shapes like car bodies, furniture, and
other objects that require smooth, flowing surfaces.

B-Spline Surfaces
B-Spline surfaces are an extension of B-Spline curves into three dimensions. A B-Spline surface
is defined by a grid of control points, and the surface is influenced by these points.

Like B-Spline curves, B-Spline surfaces offer local control and flexibility in design. They are
widely used in 3D modeling applications, especially for creating smooth and complex surfaces
such as car bodies, furniture, and other objects that require precise control.

The equation for B-Spline surface is similar to the curve.

P(u,v)=∑i=0n∑j=0mpi,jBi,p(u)Bj,q(v)

Here Bi,p(u) and Bj,q(v) are B-spline basis functions of degree p and q, respectively.
 Properties of B-Spline Surfaces
Local Control − Similar to the curve, B-Spline surfaces offer local control. You can modify part
of the surface without affecting the entire shape.
 Tight Fit to Control Points − The surface lies within the convex hull of the control points,
following their general shape.
 Flexible Design − B-Spline surfaces can be created with any number of control points and offer
more flexibility than other surface representation methods.

Polygon-Rendering Methods in Computer Graphics

Introduction:
Polygon rendering is a fundamental technique in computer graphics used to represent three-
dimensional objects in a two-dimensional space. It involves providing appropriate shading at
each point of a polygon to create the illusion of a real object. This technique is essential for
creating realistic images and animations in various applications, including video games, movies,
and simulations.

Definition:
Polygon rendering is the process of determining the color and intensity of each pixel on the
surface of a polygon in a 3D space to create a 2D image. It involves applying various shading
models, such as constant intensity shading, Gouraud shading, and Phong shading, to produce a
realistic representation of a three-dimensional object on a two-dimensional screen. The goal is to
simulate the appearance of real-world objects by accurately representing the way they reflect
light and cast shadows.

Polygon Rendering Methods

Polygon Rendering

In Computer Graphics, objects are often represented as a collection of polygons (mainly

triangles or quadrilaterals).
To display these polygons realistically, they must be rendered, i.e., converted into pixel values
on the screen with appropriate colors, shading, and lighting.

Rendering means:

Converting a geometric model (made up of vertices, edges, and faces) into a 2D image with
visual properties like brightness, color, and texture.

2. Steps in Polygon Rendering Pipeline

1. Modeling – Define the object using polygons.

2. Transformation – Convert object coordinates to screen coordinates.

3. Clipping – Remove parts outside the view area.

4. Hidden Surface Removal – Determine visible surfaces.

5. Shading & Illumination – Apply light and color effects.

6. Rasterization – Convert visible polygons into pixels.

Polygon rendering methods mainly deal with steps 5 and 6, where the polygon is shaded and
colored to appear realistic.

3. Polygon Rendering Methods

These methods define how the surface of a polygon is shaded — whether it appears flat,
smooth, or realistic with highlights and gradients.

(A) Flat Shading (Constant Intensity Shading)

 Simplest rendering method.

 Assumes single intensity/color per polygon face.

 The color is calculated using the polygon’s surface normal and lighting.

 All points on that face have the same brightness.

Algorithm:

1. Compute surface normal of the polygon.

2. Use illumination model (like Phong’s) to find color at one vertex.

3. Apply this constant color to all pixels in the polygon.

Advantages:

 Fast and simple.

 Suitable for low-polygon models.

Disadvantages:

 Produces faceted appearance (no smoothness between faces).

 Not realistic for curved surfaces.

(B) Gouraud Shading (Intensity Interpolation Method)

Developed by Henri Gouraud.

 Calculates lighting at vertices of the polygon.

 Then, interpolates the intensity values across the surface.

Algorithm:

1. Compute vertex normals by averaging normals of adjacent polygons.

2. Compute intensity at each vertex using a lighting model.

3. Perform linear interpolation of intensity along the edges.

 4. Interpolate between edges to get intensity for each pixel.

Advantages:

 Produces smooth shading across polygons.

 Faster than Phong shading.

Disadvantages:

 Misses specular highlights if they don’t fall on a vertex.

 Can cause Mach banding (visible intensity bands).

(C) Phong Shading (Normal Vector Interpolation Method)

Developed by Bui Tuong Phong.

 Instead of interpolating intensity, it interpolates surface normals across the polygon.

 Lighting is calculated per pixel, using the interpolated normal.

Algorithm:

1. Compute vertex normals (average of adjacent faces).

2. Interpolate normals across the surface.

3. Apply illumination model for each pixel.

Advantages:

 Produces realistic highlights and smooth surfaces.

 Reduces Mach banding.

Disadvantages:

 Computationally expensive (requires per-pixel lighting).

(D) Flat vs Gouraud vs Phong Comparison

Feature Flat Shading Gouraud Shading Phong Shading

Computation Fast Moderate Slow

Smoothness None Moderate Excellent

Specular Highlights Absent Poor Accurate

Feature Flat Shading Gouraud Shading Phong Shading

Realism Low Medium High

Used In Simple models Games, 3D apps High-quality rendering

(E) Other Rendering Enhancements

1. Texture Mapping:
Applies an image (texture) onto the polygon surface to add details.

2. Bump Mapping:
Adds small-scale surface irregularities without increasing polygon count.

3. Environment Mapping:
Simulates reflection of the surrounding environment on shiny objects.

4. Ray Tracing / Radiosity:

Advanced methods for realistic rendering including reflections, shadows, and global
illumination.

4. Example in Simple Terms

Imagine you have a 3D cube made of 6 polygons:

 Flat shading → Each face looks like a single solid color.

 Gouraud shading → Each face blends colors at corners, giving a soft look.

 Phong shading → Light reflects smoothly across faces; highlights look natural.

5. Applications

 Flat shading → Low-poly games, CAD models.

 Gouraud shading → Real-time applications (e.g., mobile graphics).

 Phong shading → High-quality rendering (films, simulations).

 Texture/Bump mapping → Photorealistic visualization.

🧠 6. Summary Diagram (Text Representation)

Polygon Rendering Methods

│
 ┌───────────────┴───────────────┐

│ │

Shading Methods Mapping Methods

│ │

┌────┼─────┬────┐ ┌────┼────┐

│ Flat │ Gouraud │ Phong │ │ Texture │ Bump │

└────┴─────┴────┘ └────┴────┘

In summary:
Polygon rendering methods are essential for converting geometric data into visually appealing
images. Choosing the right method depends on the balance between realism and performance.

Different polygon rendering methods in computer graphics:

1. Constant Intensity Shading
2. Gouraud Shading
3. Phong Shading

Constant Intensity Shading

It is a simple method of polygon rendering. It is also called Flat shading. In this method every
point has constant intensity. All point of polygon has same intensity value. It is fast rendering
method. It is useful for displaying simple curved surface appearances.

Gouraud Shading
It is developed by Gouraud. This rendering is done by intensity interpolation. At each point the
intensity value is calculated. It interpolates linearly in the surface of the polygon. It eliminates
intensity discontinuity. It has match bands.

Phong Shading
It is more accurate method of polygon rendering. At each point of the surface, it interpolates the
normal vector and applies the illumination model. It is also called as normal vector interpolation
shading. It gives more real highlights of the surface. It reduces match bands.
Comparision of various Polygon-Rendering Methods

Method Description Advantages Disadvantages

Unrealistic
Also known as flat shading.
Fast rendering method, appearance, no
Constant Every point on the polygon
useful for displaying consideration for
Intensity has the same constant
simple curved surface surface smoothness or
Shading intensity value, resulting in
appearances. reflection.
a uniform appearance.

Based on the interpolation

Eliminates intensity
of intensities between the
discontinuities, reduces
vertices of a polygon. Less accurate than
Gouraud appearance of banding.
Calculates the intensity Phong shading.
Shading More realistic
value for each point by
appearance than flat
linear interpolation across
shading.
the surface of the polygon.

Interpolates the surface's

normal vector at each point Computationally
Provides the most
and applies the illumination expensive, may result
accurate representation
model. Gives more realistic in longer rendering
of the object's reflection
highlights to the surface and times.
and shading.
Phong reduces appearance of
Shading match bands.
Color Models
In computer graphics, a color model (also called a color space or color system) is a way of
representing colors as sets of numerical values.

Each color model defines:

 How colors are represented (using parameters like red, green, blue, hue, saturation,
etc.)

 How colors are combined or manipulated

 How to convert between different color representations

Different devices (monitors, printers, cameras) use different color models because color
generation methods differ — light emission for screens, pigment reflection for print, etc.

Why We Need Color Models

 We must represent colors numerically for processing and storage.

 We need a consistent way to manipulate and display colors across devices.

 We must convert colors between systems (e.g., RGB → CMYK for printing).

Classification of Color Models

Color models can be broadly divided into two main categories:

Type Used For Example Models

Additive Models Devices that emit light (Monitors, TVs, Projectors) RGB

Subtractive Models Devices that absorb/reflect light (Printers, Paints) CMY, CMYK

Other models (like HSV, HSL, YIQ, YCbCr) are derived or perceptual models used for
human-friendly manipulation or transmission.
1. RGB Color Model (Additive Model)

Concept:

 Based on light emission — used by display devices (monitors, cameras, projectors).

 Colors are created by adding light of three primary colors:

o R = Red

o G = Green

o B = Blue

When combined:

 Red + Green = Yellow

 Green + Blue = Cyan

 Blue + Red = Magenta

 Red + Green + Blue = White

 No light (0,0,0) = Black

Hence, called additive because colors add to form white.

Applications:

 Computer monitors

 Televisions

 Digital cameras

 Computer graphics rendering

2. CMY and CMYK Color Models (Subtractive Models)

Concept:

 Used in printing and painting, where colors are formed by subtracting light
(absorbing wavelengths).

 Primary colors here are:

o C = Cyan

o M = Magenta

o Y = Yellow

Applications:

 Color printing

 Publishing and graphic design

 Packaging industry

Breakdown:
Model Used In Components Description

Y (Luminance), I & Q Human eye more sensitive

YIQ NTSC TV (USA)
(Chrominance) to Y

PAL/SECAM Y (Brightness), U & V (Color

YUV Video encoding
TV difference)

Y (Luma), Cb, Cr (Blue & Red

YCbCr JPEG, MPEG Digital images & video
difference)

Applications:

 Analog and digital TV

 Image compression (JPEG)

 Video processing (MPEG)

🧠 Summary Table

Model Type Components Used In Notes

Monitors,
RGB Additive R, G, B Device-dependent
Cameras

Complementary to
CMY/CMYK Subtractive C, M, Y, (K) Printing
RGB

Color pickers,
HSV Perceptual H, S, V User-friendly
Vision

HSL Perceptual H, S, L Web Design Similar to HSV

YIQ / YUV / Y, Separate brightness &

Transmission Video/TV
YCbCr I/Q/U/V/Cb/Cr color

Perceptual
CIE XYZ X, Y, Z Color science Device-independent
Standard
Conclusion

Color models are essential in computer graphics for:

 Representing and manipulating colors

 Maintaining color consistency across devices

 Achieving realistic rendering and effects

 RGB → For display

 CMYK → For printing

 HSV/HSL → For human-friendly interaction

 YUV/YCbCr → For broadcasting and compression

Each color model serves a specific purpose, domain, and application.

Colour Applications
Colour is one of the most important aspects of computer graphics because it directly affects
realism, perception, aesthetics, and usability. Different applications of colour in graphics
involve:

 Improving visual appeal

 Conveying information
 Enhancing interaction
 Supporting realism in simulations and visualization
🔹 Applications of Colour in Computer Graphics

1. User Interfaces (UI) and Human–Computer Interaction

 Purpose: Colours are used in GUI (Graphical User Interfaces) for buttons, menus, and
icons.
 Applications:
o Highlighting selected items.
o Differentiating between active/inactive windows.
o Using standard colours for warnings (red for errors, green for success).
 Example: Windows OS, mobile app interfaces, websites.

2. Data Visualization and Graphs

 Purpose: Colour helps in conveying complex data effectively.

 Applications:
o Line graphs, bar charts, pie charts use different colours for categories.
o Heat maps use colour gradients to represent intensity or magnitude.
o Scientific visualization uses false-colour imaging (e.g., weather maps, medical
scans).
 Example: Stock market trend charts, climate temperature maps.

3. Image Processing and Enhancement

 Purpose: Colour models (RGB, CMY, HSV, etc.) are used in image editing and
manipulation.
 Applications:
o Colour correction in photography.
o Filtering and enhancement (brightness, contrast, saturation).
o Colour segmentation for object detection.
 Example: Photoshop, GIMP, AI-based image enhancement.

4. Animation and Multimedia

 Purpose: Colours add realism, mood, and visual storytelling to animations.

 Applications:
o Background shading and lighting effects.
o Character design with distinct colour schemes.
o Use of complementary and contrasting colours to create appeal.
 Example: Animated films (Pixar, Disney), 2D/3D games.

5. Virtual Reality (VR) and Augmented Reality (AR)

 Purpose: Colours create immersive environments and aid user navigation.

 Applications:
 o Depth perception through shading and gradients.
o Overlay of AR elements (highlighting objects in real-world view).
o Mood creation in VR simulations (dark colours for mystery, bright for lively
scenes).

6. Medical Imaging

 Purpose: Colours highlight features that may not be visible in grayscale.

 Applications:
o MRI and CT scans use pseudo-colour mapping.
o PET scans use colour to show intensity of activity.
o Colour segmentation for identifying tissues, tumors, or anomalies.

7. Geographic Information Systems (GIS) and Mapping

 Purpose: Colour helps represent geographic and spatial data.

 Applications:
o Topographic maps (green for plains, brown for mountains, blue for water bodies).
o Satellite imagery analysis.
o Population density maps using heat colours.
 Example: Google Maps, ArcGIS.

8. Computer-Aided Design (CAD)

 Purpose: Engineers, architects, and designers use colour to represent materials and
layers.
 Applications:
o Differentiating parts of machinery.
o Shading models to visualize light and shadow effects.
o Applying textures with realistic colours.
 Example: AutoCAD, SolidWorks.

9. Gaming and Entertainment

 Purpose: Colour plays a critical role in aesthetics, mood, and gameplay mechanics.
 Applications:
o Backgrounds and environments.
o Health bars (green → safe, red → danger).
o Colour-coded power-ups or difficulty levels.
 Example: Call of Duty, PUBG, Mario games.

10. Education and Training

 Purpose: Colour enhances understanding and memory in learning systems.

 Applications:
 o Interactive learning software using distinct colours for different topics.
o Flight simulators use realistic colours for cockpit controls.
o Chemistry/biology visualizations (molecular models with different atom colours).

Benefits of Using Colour in Graphics

 Enhances realism in rendering and visualization.

 Improves user interaction and readability.
 Helps in categorization and grouping of data.
 Conveys emotion and mood effectively.
 Supports decision-making in simulations and visual analytics.