JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech III COMPUTER GRAPHICS Previous Question Paper (September - 2021 - R16)

B.Tech | III | I | R16 | September - 2021

Answer PaperPaper Code: 135BYMaximum Marks: 75Time: 3 hours

Answer any five questions. All questions carry equal marks.

Main

115 marks
a

List the operating characteristics for the following display technologies: raster refresh systems, vector refresh systems, plasma panels and CDs.

8 marks

Answer

The operating characteristics for the specified display technologies are as follows:

  • Raster Refresh Systems: These systems store the image definition in a frame buffer as a set of intensity values for pixel positions. The electron beam sweeps across the screen row by row (scan lines) to refresh the display at a typical rate of 60 to 120 frames per second. It is suitable for displaying complex shaded scenes and solid areas.
  • Vector Refresh Systems: Also known as random-scan displays, these systems draw an image by directing the electron beam only along the paths of the lines to be displayed. The display processor cycles through a display list of commands to redraw the lines repeatedly. It provides high resolution for line drawings but cannot easily display complex filled-in scenes.
  • Plasma Panels: These are emissive displays that use a grid of conductors with a neon-based gas mixture sealed between glass plates. A voltage applied to intersecting conductors causes the gas to ionize and glow at that pixel location. They provide a stable, flicker-free image and are generally thin, though they have lower resolution compared to modern LCDs.
  • LCDs (Liquid Crystal Displays): These are non-emissive devices that control light transmission by applying varying voltages to liquid crystal cells. The crystals rotate polarized light to either block or pass light from a backlight source. They are characterized by low power consumption, compact size, and are the standard for modern flat-panel displays.
b

Set up a procedure for a parallel implementation of the midpoint ellipse algorithm.

7 marks

Answer

The midpoint ellipse algorithm can be parallelized by partitioning the ellipse path into multiple segments and assigning each segment to a different processor. The procedure is as follows:

  1. Domain Decomposition: Divide the total angular range of the ellipse (0 to 2π) into N equal segments, where N is the number of available processors.
  2. Parameter Calculation: Each processor calculates the starting coordinates (x, y) for its assigned angular segment using the parametric equations:
    x = x₀ + rₓ cos(θ)
    y = y₀ + rᵧ sin(θ)
  3. Local Execution: Each processor independently executes the standard midpoint ellipse algorithm for its specific segment. Since the algorithm is incremental, each processor uses the local decision parameter to determine the next pixel position within its assigned arc.
  4. Synchronization and Merging: Once all processors complete their pixel calculations, the results are merged into the frame buffer. Because the ellipse is a continuous closed curve, ensure that boundary pixels between segments are handled to avoid gaps or overlaps.
215 marks
a

Write a boundary-fill procedure to fill an 8-connected region.

8 marks

Answer

Sign in to view the complete answer paper.

b

Write a procedure to fill the interior of give ellipse with specified pattern.

7 marks

Answer

Sign in to view the complete answer paper.

315 marks
a

Discuss why the Sutherland-Hodgeman polygon clipping algorithm works for only convex clipping regions.

8 marks

Answer

Sign in to view the complete answer paper.

b

Contrast the efficiency of Cohen-Sutherland and Liang-Barsky line clipping algorithms.

7 marks

Answer

Sign in to view the complete answer paper.

415 marks
a

Derive the transformation matrix for rotation about an arbitrary point.

8 marks

Answer

Sign in to view the complete answer paper.

b

Explain about the 2D viewing function.

7 marks

Answer

Sign in to view the complete answer paper.

5

Briefly explain the Bezier and B-Spline surfaces.

15 marks

Answer

Sign in to view the complete answer paper.

6

Derive the transformation matrix for Hermite curve.

15 marks

Answer

Sign in to view the complete answer paper.

7

Distinguish between object-space and image space methods of visible surface detection algorithms. Give examples for each.

15 marks

Answer

Sign in to view the complete answer paper.

815 marks
a

Explain briefly about key frame systems.

7 marks

Answer

Sign in to view the complete answer paper.

b

Design a storyboard layout and accompanying key frames for an animation of a single polyhedron.

8 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the solved question paper with answers of COMPUTER GRAPHICS from JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD for B.Tech IT III I, September - 2021, R16.

For the question paper without answers, switch to the Question Paper tab.

Other papers in COMPUTER GRAPHICS

Loading Question Papers

Fetching data from database...