Visible-surface detection, Computer Graphics

Visible-Surface Detection

For the generation of realistic graphics display you know that hidden surfaces and hidden lines should be identified for removing. For this reason we require to conduct visibility tests. Visibility tests try to specify the visible surfaces or visible edges such are visible from a specified viewpoint. Visibility tests are performed via making use of either

object-space or              

 image-space or

Both object-space and image-spaces.

Object-space approaches utilize the directions of a surface normal with respect to a viewing direction to identify a back face. Image-space approaches employ two buffers as: one for storing the pixel intensities and the other for updating the depth of the visible surfaces from the view plane. A method that uses both image-space and object-space employs depth for sorting or reordering of surfaces. In this category this methods also utilize image-space for conducting visibility type tests. While making visibility tests, coherency property is employed to make the method extremely fast.

In this matter, we will discuss three algorithms or methods for detecting visible surfaces as:

  • Depth-buffer method
  • Scan-line method
  • Area subdivision method

Depth-buffer method and Scan-line method come beneath the category of image-space, and area-subdivision method utilizes both image-space and object-space approach.

Posted Date: 3/22/2013 8:26:24 AM | Location : United States







Related Discussions:- Visible-surface detection, Assignment Help, Ask Question on Visible-surface detection, Get Answer, Expert's Help, Visible-surface detection Discussions

Write discussion on Visible-surface detection
Your posts are moderated
Related Questions
Removing Polygons Hidden through a Surrounding Polygon: The key to capable visibility calculation lies actually a polygon is not visible whether it is in back of a surrounding

List out the various Text clipping?  All-or-none string clipping -if all of the string is inside a clip window, keep it or else discards. All-or-none character clipping - disca

How to utilize illumination model to calculate vertex intensity: For such we interpolate intensities beside the polygon edges, for all scan line the intensity at the intersecti

Types of Graphic Images: Graphic images have been processed through a computer can generally be divided in two distinct categories. That image is either bitmap files or vecto

Write a C-code that plots an object on the window and on the user's click of mouse on the window, the object starts rotating continuously until the user presses the mouse again.

Characteristics of Bitmap Data: Bitmap data can take up many rooms. A CMYK A-4 size picture which is optimized for medium quality printing (150 lpi) takes up 40 Mage Bytes. Compre

Algorithms for Basic Line Segment Plotting There are two important algorithms for basic line segment plotting-DDA algorithm and Bresenham algorithm.  Both the algorithms use th

Explain the merits and demerits of Penetration techniques. The merits and demerits of the Penetration techniques are as follows:     It is an inexpensive method.     It h

Methods of Animation - Computer Animation First method: in this, artist makes a succession of cartoon frames that are then combined in a film. Second method: in this,

Draw a long line segment using (i) DDA line drawing algorithm (ii) Bresenham line drawing algorithm (iii) OpenGL function using GL_LINES.  Observe if DDA line segment deflects from