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.
explain the working procedure of crt digram
What is the difference between impact and non-impact printers? Impact printer press produced character faces against an inked ribbon on to the paper. A line printer and dot-ma
Illustration 1: How does the z-buffer algorithm find out which surfaces are hidden? Solution : Depth or Z-buffer algorithm employs a two buffer area each of two-dimensional ar
What is scaling? The scaling transformations changes the shape of an object and can be carried out by multiplying every vertex (x,y) by scaling factor Sx, Sy where Sx is the
Specified p 0 (1, 1): p 1 (2, 3); p 2 (4, 3); p 3 (3, 1) as vertices of Bezier curve find out 3 points on Bezier curve? Solution : We consider Cubic Bezier curve as: P (
Disadvantage of the Raster Scan Display Device The major disadvantage of the raster scan is the jagged nature of the lines, happening from the information that the pixels are
Important Points for Windowing Transformations 1. Window explains what is to be viewed and viewpoint describes where it is to be displayed. 2. Frequently window and viewpoi
limitations of cohen sutherland line clipping
Basic Ray Tracing Algorithm - Polygon Rendering The Hidden-surface removal is the most complete and most versatile method for display of objects in a realistic fashion. The co
Rotation about an arbitrary axis Rotation about an arbitrary axis is a composition of several rotations and translation operations. What you need to do is the following: a)
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