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

Scale a sphere cantered on the point (1, Scale a sphere cantered on the poi...

Scale a sphere cantered on the point (1, 2, and 3) with radius 1, so that the new sphere has the same centre with radius 2.    Solution: Translate the sphere so that its centre

Vecgen algorithm, explain vecgen line drawing algorithm

explain vecgen line drawing algorithm

Key frame systems, Ask questionkms eey frame syst #Minimum 100 words accept...

Ask questionkms eey frame syst #Minimum 100 words accepted#

What is computer graphics?, What Is Computer Graphics? The term Graphi...

What Is Computer Graphics? The term Graphics mean is Graphical Tricks. All image or picture is actually a graph and when various mathematical tricks are utilized to manipulate

Determine how many key frames does one minute animation film, How many key ...

How many key frames does one minute animation film order along with no duplications need if there are five in among for each pair of key frames?   Solution : One minute = 60 sec

What you mean by parallel projection, What you mean by parallel projection?...

What you mean by parallel projection?  Parallel projection is one in which z coordinates is discarded and parallel lines from every vertex on the object are extended unless the

Crt, crt is an analog or digital device

crt is an analog or digital device

Bezier curves, find out points to the given control points

find out points to the given control points

Sutherland hodgeman polygon clipping algorithm, What is clipping? Explain S...

What is clipping? Explain Sutherland Hodgeman polygon clipping algorithm with example.  OR Write the algorithm for Sutherland Hodgeman Polygon. Beginning with the initial set of p

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