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
Test For checking Disjoint Polygons by using of Min-max Test Test 1: For checking disjoint polygons by using of Min-max test. Assume that you have two polygons as P1 and

what is refresh buffer/ identify the content and organisation of the refresh buffer for the case of raster display and vector display.

a__________of a scene is apart of a scene by which relate one part of the scene with the other parts of the scene

determine the form of the transformation matrix for a reflection about an arbitrary line with equation y=mx+b.

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

1. Implement the boundary fill algorithm and flood fill algorithm in C-language and use your code to fill two different types of closed areas such as  i)  A Circle ii)  A sel

Structural Links: The information contained inside the hypermedia application is classically organized in several suitable fashions. This organization is represented by using stru

Rotation - 2-D and 3-D transformations Within 2-D rotation, an object is rotated via an angle θ along w.r.t. the origin. This angle is assumed to be +ive for anticlockwise rot

Vanishing Point - Viewing Transformations This point is that point at those parallel lines shows to converge and vanish. A practical illustration is a long straight railroad

what is curve clipping