Graphics And Multimedia Notes Pdf

1. Introduction To Multimedia Notes Pdf
2. Computer Graphics Pdf Notes

Topics covered in these Computer Graphics & Multimedia Notes & eBook:Unit 1 - Graphics Primitives: Introduction, Raster & Random display concepts and devices, CRT, Primitive operations, The display file interpreter, Normalized device co-ordinates, Display file structure, Display file algorithms, Display control.

Introduction To Multimedia Notes Pdf

Category:Computer Graphics notes:2D & 3D Co-ordinate system: Homogeneous Co-ordinates, Translation, Rotation, Scaling, Reflection, Inverse transformation, Composite transformation. Polygon Representation, Flood Filling, Boundary filling.Point Clipping, Cohen-Sutherland Line Clipping Algorithm, Polygon Clipping algorithms.so this is the syllabus for the computer graphics and multimedia techniques. Now you can easily go through the most important question, according to the RTU exam point of view. Download Computer Graphics Notes in pdfYou Can easily download the computer graphics and Multimedia techniques notes from the link given at the end of the Slove question paper.This paper is designed according to the rtu 6th sem CSE branch, computer graphics, and Multimedia techniques Chapter. Explain flood algorithm. Differentiate it with boundary Fill algorithm?Answer of the given question is given below and you can easily download the computer graphics notes from the belowAnswer:Seed FillThe seed fills calculation advances as surge fill calculation and boundary fill calculation.

Calculations that do inside characterized segment are called surge fill calculations and those that complete boundary-characterized area is called boundary-fill calculations or edge-fill calculations.Boundary Fill AlgorithmIn this strategy, the boundary of the polygons is drawn. At that point start with some seed, anytime inside the polygon we survey the adjacent pixels to ponder whether the boundary pixel is connected.In the event that boundary pixels are not connected out, pixels are calling attention to and the procedure proceeds as late as boundary pixels are connected.Boundary defined section may be either 4-connected or 8-connected as shown in the figure. If a section is 4-connected, then every pixel in the section may be reached out by a blend of moves in only four directions: left, right, up and down.For an 8-connected section, every pixel in the section may be reached out by a blend of moves in the two horizontal, two vertical, and four diagonal directions.

ClippingPoint ClippingThe points are called to the interior to the clipping window ifXw min. Sutherland and Cohen subdivision line clipping algorithm. Read two endpoints of the line say P1 (x1, y1) and P2 (x2, y2). Read two corners (left-top and right-bottom) of the window, say (Wx1, Wy1, and Wx2, Wy2). Allocate the section codes for two endpoints P1 and P2.

Using following steps: Initialize code with bits 0000SetBit- 1 if (x Wx2)SetBit- 3 if (y Wy1). Check for permeability of line P1 P2a) If area codes for the two endpoints P1 and P2 are 0 then the line is altogether noticeable.

Computer Graphics Pdf Notes

Henceforth take a stand and go to stageb) If area codes for endpoints are not 0 and the coherent ANDing of them is additionally nonzero then the line is altogether unfit to see, so decrease the line and go to stage 9.c) If area codes for two endpoints don’t satisfy the conditions in 4a) and 4b) the line is somewhat unmistakable.5. Determine the converging edge of the plunging window by analyzing the area codes of two endpoints.a) If area codes for both the endpoints are non-zero, discover convergence focuses P1 and P2the with limit edges of section window with respect to point P1 and point P2, separately.b) If area code for anybody and endpoint is nonzero then discover convergence point P1 or P2 with the limit edge of the cut-out window regarding it.6. Divide the line area considering convergence focuses.7. Reject the line area on the off chance that anybody endpoint of it end up unmistakable exterior the section window.8. Draw the rest of the line portions.9. What is Homogenous co-ordinate?

Discuss the composite transformation matrices for two successive translation and scaling?Answer of the given question is given below and you can easily download the computer graphics notes from the belowVery nearly all graphics system allow the developer to define a picture that shows the variety of transformation.For example, the developer is able to enhance a picture so that depth appears more crystal clean, or narrow it so that some more of the picture is visible. The developer is as well as able to rotate the picture so that he can see it in different angles.Homogeneous coordinates for translation. Homogeneous coordinates for scaling 4. Describe Polygon Clipping?Answer of the given question is given below and you can easily download the computer graphics notes from the belowPolygon ClippingIn the last request, we have seen line clipping figurings.

A polygon is just the social event of lines. Hence, we may envision that the line clipping count can be used straight for polygon clipping.Regardless, when a not open polygon is clipped as a social affair of lines with line clipping computation the veritable quiets polygon slows down no less than one open polygon or discrete lines as showed up in the figure.So in this manner, we need to restyle the line clipping figuring to cut polygons.We think about polygon as a close solid domain. Thusly in the wake of clipping, it should remain closed. To get this we require a count that will develop additional line portion which acknowledges the polygon as a closed region.For example, in the figure the lines a -‘b, c – d, d – e, f – g and h – i are added to polygon description to make it closed.Adding lines c – d and d – e is particularly hard. The considerable difficulty also occurs when clipping a polygon results in respective disjoin smaller polygons as the display in the figure.