Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
2D Line Segment Generation
A digitally plotted line is basically an approximation of infinite number of points on an abstract line segment by only a finite number of points on a computer display. This is needed because the display devices can only plot a finite number of points, however large the resolution of the device may be. So, the key concept of any line drawing algorithm is to provide an efficient way of mapping a continuous abstract line into a discrete plane of computer display.
This process is called rasterization or scan conversion. These algorithms basically approximate a real valued line by calculating pixel coordinates to provide an illusion of line segment. Since the pixels are sufficiently small, the approximation gives a good illusion of a continuous line segment to the human eyes. To understand what is meant by rasterization, we plot a line segment on a pixel grid as shown in Fig (a). The segment points are scan converted and approximated by a single shaded pixel as shown in Fig (b). Here we have shown a pixel by a square, but you know that a pixel actually has a disc shape with the boundary marked as the visible portion of the dot formed by the striking electron gun. The pixel shown here is the bounding rectangle of that dot.
What is orthographic oblique projection? When the direction of the projection is not normal (not perpendicular) to the view plane then the projection is called as oblique proj
2-D Viewing and Clipping - Raster Graphics and Clipping In the previous two units of this block, we illustrated the basic elements of computer graphics, that is, the hardware
QUESTION a) What is a color management system? Briefly explain how it works. b) What are the three major factors affecting print permanence? c) Briefly explain three ways
Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping,
determine the tranformation matrix for reflection,computer graphics
Determine about the Liquid Crystal Display LCDs are organic molecules, naturally in crystalline state, and they get liquified when excited by heat or E field. Crystalline state
Photo and Video were determined in the 19th century: In books Visuals as add on to texts. They enabled distance education. They developed learning where verbal description was n
differece between circle and eclipse
Can you tell which main components (hardware and software) are needed for computer graphics? Besides the computer, some special devices and software may be needed especially fo
Curve segment - properties of bezier curves Note : 1) The joining point on the curve along w.r.t. the parameter based upon second derivates of Q(t) is the acceleration. Wh
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd