Scribd
Upload
4 views5 pages

Unit 1 Questions

The document covers various topics related to computer graphics, including homogeneous coordinate systems, frame buffers, and algorithms for line and circle generation. It discusses the properties and applications of Bezier curves, as well as different filling algorithms like seed fill and scan line polygon fill. Additionally, it addresses transformations, rotations, and comparisons between different graphics techniques and devices.

Uploaded by

Vikas Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views5 pages

Unit 1 Questions

The document covers various topics related to computer graphics, including homogeneous coordinate systems, frame buffers, and algorithms for line and circle generation. It discusses the properties and applications of Bezier curves, as well as different filling algorithms like seed fill and scan line polygon fill. Additionally, it addresses transformations, rotations, and comparisons between different graphics techniques and devices.

Uploaded by

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

• What is homogeneous coordinate system?

Why
is it needed? Explain with the help of an example.
• What is frame buffer? How is intensity
controlled with the help of frame buffer?.
• Write mid-point circle generation algorithm.
•What is seed fill or flood fill algorithm?
Distinguish it with scan line polygon fill algorithm.
• Describe DDA algorithm. Modify the DDA
algorithm for negative sloped lines. Discuss both
the case i.e., slope > 1 and 0 < slope < 1.
• Reflect the diamond-shaped polygon whose
vertices are A (– 1, 0), B (0, – 2), C (1, 0) and D (0,
2) about : (i) the horizontal line y = 2, (ii) the line y
= x + 2.
• Given four control points P0 (1, 1), P1 (2, 3) P2
(4, 3) and P3 (3, 1). Determine two more points on
the same Bezier curve.
• Prove the following properties of Bezier curve : (
) 0P 0u p= = and ∑ = ( ) 1 i n n i i B u = .
• Find the 3 × 3 homogeneous co-ordinate
transformation matrix for each of the following :
(i) Scale an image by 3 units in both X and Y-
direction w. r. t. origin, (ii) Shift the image up by 2
units and down by 1 unit w. r. t. origin, (iii) Rotate
the image by 45° in anticlockwise direction w. r. t.
origin.
• Briefly discuss the concept of parametric
continuities in Bezier curve.
• Discuss all the cases of scan line polygon fill
algorithm, with suitable diagram.
• Verify the statement that “two successive
rotations are additive in nature”.
• Determine the general expression for a cubic
Bezier curve, with vertices (control point) P0(0,
40); P1(40, 40); P2(60, 20); P3(60, –10), and use it
to find two points on the curve.
• Write the midpoint circle generation algorithm
and use the same to produce a circular arc of
radius 8 units in the first quadrant from x = 0 to x
= y.
• Write the Pseudo Code of DDA line generation
algorithm, and use it to produce a line segment
between points (1, 1) and (9, 7). Also compare
DDA line generation algorithm and Bresenham
line generation algorithm.
• Prove , L 0 B (4) 1 n n i   , where ,B (4)n i is
the Bernstein Polynomial.
• Explain how frame buffer is used to store picture
information.
• Write the difference between Random and
Raster scan display devices.
• Write the DDA algorithm for line generation and
modify the same for negative sloped lines.
• Perform 45° rotation of triangle ABC; A(0, 2) B(–
1, –1), C(1, –1) about an axis passing through
origin.
• Differentiate between Bitmap vs Vector
graphics.
• Write Bresenham’s line generation algorithm.
Draw the line segment joining the point (2, 4) and
(9, 9) using Bresenham’s line generation
algorithm.
• Write midpoint circle generation algorithm.
Determine positions along the circle octants in Ist
Quadrant from x = 0 to x = y with given a radius r =
5.
• Find the transformation matrix for the reflection
about the line y = –x.
• “Simultaneous shearing is not the same as
shearing in one direction; followed by shearing in
another direction.” Justify the statement
mathematically.
• Prove the following properties of a Bezier curve :
( 0) P 0 p u and ( 1) P  np u where u is the
parameter and 0P and Pn are the zeroth and nth
control point, respectively.
• Compare parametric and geometric continuities
of Bezier curves.
• Differentiate between Raster Scan display
devices and Random scan display devices.
• Differentiate between Scan line polygon fill
algorithm and flood fill algorithm.
• Differentiate between Painting Drawing.
• What is Bezier curves? Write the properties of
Bezier curves.
• Explain the technique of Anti-Aliasing with
suitable example.
• Write down the DDA algorithm for generation of
line segment. Draw line segment from point (2, 4)
to (9, 9) using DDA algorithm.
• Write Mid-point circle generation algorithm.
Given a circle of radius r = 5, determine points on
the arc of the circle is first quadrant from x = 0 to x
= y.
• What are parametric continuities? Discuss each
type of parametric continuity.
• Explain Stair-Case effects.
• Explain Frame Buffer for Intensity Control.

You might also like