Image space -approaches for visible surface determination, Computer Graphics

Assignment Help:

Image Space Approach -Approaches for visible surface determination

The initial approach as image-space, determines that of n objects in the scene is visible at every pixel in the image. The pseudo-code for such approach as like:

           for(each pixel in the image) 

           {

               determine the object closest to the viewer that is passed by the projector through the pixel;

                draw the pixel in the appropriate color;

            }

This approach needs examining all the objects means to find out which is closest to the viewer besides the projector passing via the pixel. It is, in an image-space algorithm, the visibility is certain point by point at each pixel location on the projection plane. Effort is proportional to n.p., if the number of objects is 'n' and the pixels is 'p'.


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

PHONG INTERPOLATION, DESCRIBE PHONG INTERPOLATION SHADING METHOD

DESCRIBE PHONG INTERPOLATION SHADING METHOD

Character generation, Which is the most usable and frequent method to gener...

Which is the most usable and frequent method to generate a character?

Define advanced graphics port, Q. Define Advanced Graphics Port? AGP si...

Q. Define Advanced Graphics Port? AGP signify Advanced (or Accelerated) Graphics Port. It's a connector standard defining a high speed bus connection between the microprocessor

Remark for the bresenham line generation algorithm, Remark for the Bresenha...

Remark for the Bresenham Line Generation Algorithm Remark: The algorithm will be properly the same if we suppose | m | Algorithm | m | (a) Input two line endi

Scenes - polygon rendering and ray tracing methods, Scenes - polygon render...

Scenes - polygon rendering and ray tracing methods In the context of ray tracing, a scene is a set of objects and light sources which will be viewed through a camera. All of

Clip a line segment - cyrus beck line clipping algorithm, How does the Cyru...

How does the Cyrus Beck line clipping algorithm, clip a line segment whether the window is non convex? Solution : see the following figure 13, now the window is non-convex in s

Basic transformations - 2-d and 3-d transformations, Basic Transformations ...

Basic Transformations - 2-d and 3-d Transformations Consider the xy-coordinate system upon a plane. An object or Obj in a plane can be identified as a set of points. All objec

Computer simulation - computer aided design, Computer simulation - Computer...

Computer simulation - Computer Aided Design Computer simulation is the manner of designing a model of a real or theoretical physical system, not including the model on a digit

What is scan line algorithm, What is scan line algorithm?  One way to f...

What is scan line algorithm?  One way to fill the polygon is to apply the inside test. I.e. to check whether the pixel is inside the polygon or outside the polygon and then hig

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