Object space - approaches for visible surface determination, Computer Graphics

Assignment Help:

Object Space - approaches for visible surface determination

The second approach as object-space that compares all objects directly along with each other inside the scene definition and removes those objects or portion of objects which are not visible. In terms of pseudo-code, we comprise:

    for (each object in the world) 

        {

            determine those parts of the object whose view is unobstructed (not blocked)

by other

             parts of it or any other object;

             draw those parts in the appropriate color;

         }

This approach compares all of the n objects to itself and to another objects, and discarding unseen portions. Hence, the computational effort is proportional to n2.


Related Discussions:- Object space - approaches for visible surface determination

Phong shading algorithm, Q. Describe briefly phong shading algorithm.   ...

Q. Describe briefly phong shading algorithm.   OR                Write short note on phong shading.    Phong shading   Phong shading or normal vector interpo

Zero acceleration (constant speed), Zero Acceleration (Constant Speed ) ...

Zero Acceleration (Constant Speed ) Now, the time spacing for the in-betweens that is: in-between frames is at equal interval; which is if, we want N in-betweens for key frames

Area-subdivision method-computer graphics, Normal 0 false fal...

Normal 0 false false false EN-US X-NONE X-NONE

Midpoint circle generation algorithm - 2d shape primitives, Midpoint Circle...

Midpoint Circle Generation Algorithm   Just as a line drawing algorithm approximates infinite number of points on a line segment by only a finite number of pixels, a circle dra

Advantages of bresenham’s line drawing algorithm, What are the advantages o...

What are the advantages of Bresenham's line drawing algorithm over DDA line drawing algorithm? DDA and Bresenham algorithms both are efficient line drawing algorithm. Breaenham

Cases of clip a line segment-pq, Cases of clip a line segment-pq Case...

Cases of clip a line segment-pq Case 1: As we determine a new value of t E that is value of parameter t for any potentially entering (PE) point we select t max as:  t max

Rotation about the origin - 2-d and 3-d transformations, Rotation about the...

Rotation about the origin - 2-d and 3-d transformations Specified a 2-D point P(x,y), which we need to rotate, along with respect to the origin O. The vector OP has a length '

CRT, Explain working of CRT

Explain working of CRT

How graphics output changes according to dpi, Question : (a) List and d...

Question : (a) List and describe important aspects to take into consideration when looking at paper for print. (b) Describe clearly the meaning of the following words: I.

Implement cohen sutherland and liang barsky algorithm, Implement Cohen Suth...

Implement Cohen Sutherland and Liang Barsky line clipping algorithms in C-language.  Test your code for line segments with end points falling in various regions.

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