For orthographic parallel projection, Computer Graphics

Assignment Help:

For orthographic parallel projection:   

glOrtho(left, right, bottom, top, near, far); 

glOrtho2D(left, right, bottom, top);   

Here left, right define the x-direction extents, bottom, top define y-direction extents and near, far define the z-direction extents of the view volume. gluOrtho2D is exactly like glOrtho, but with near = -1 and far = 1. That is, gluOrtho2D views points that have z-value between -1 and 1. Usually, gluOrtho2D is used when drawing two-dimensional figures that lie in the xy-plane, with z = 0.


Related Discussions:- For orthographic parallel projection

Medicine-applications for computer animation, Medicine: this is very tough...

Medicine: this is very tough for a doctor to get inside a living human body and to observe what is occurrence. Computer animation once again comes in very helpful. Every particula

Area-subdivision method, Area-Subdivision method This method is a ty...

Area-Subdivision method This method is a type of an image-space method although uses object-space operations re-ordering or sorting of surfaces as per to depth. Area sub-div

Line clipping algorithm - cohen sutherland algorithm, Line Clipping Algorit...

Line Clipping Algorithm - Cohen Sutherland Algorithm Line is a series of endless number of points; here no two points contain space in among them. Hence, the above said inequa

Explain vector graphics and raster graphics, Question: (a) In computer...

Question: (a) In computer graphics it is important to distinguish between the two approaches to graphical modeling:vector graphics and raster graphics. Explain in details th

Uncompressed and common audio format, Uncompressed / Common Audio Format ...

Uncompressed / Common Audio Format There is one main uncompressed audio format: PCM. It is generally stored like a .wav on Windows. WAV is file format which is flexible and des

Sutherland hodgman algorithm, Sutherland-Hodgman Algorithm Any polygon...

Sutherland-Hodgman Algorithm Any polygon of any type of arbitrary shape can be explained with the assist of some set of vertices connected with it. While we try to clip the po

How many key frames does a one-minute animation film, How many key frames d...

How many key frames does a one-minute animation film order along with no duplications need? Solution : One minute = 60 seconds Number of frames needed per second=24 Numbe

Bezier curves - 2d shape primitives, Bezier curves: Theses are special...

Bezier curves: Theses are special polynomial curves expressed using Bernstein polynomials. Spline curves are simple extensions of Bézier curves composed of two or more polynom

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd