Introduction of visible surface detection, Computer Graphics

Assignment Help:

Introduction of Visible Surface Detection

  • For displaying a realistic presentation of the given 3Dimentional object, hidden surfaces and hidden lines should be identified for remove.
  • The process of considering and eliminating of these hidden surfaces is termed as the visible-line/surface determination or it may be hidden-line/surface elimination.
  • To build a realistic view of the specified 3Dimentional object, it is essential to find out that lines or surfaces of the objects are visible. For this, we necessitate to conduct visibility tests.
  • Visibility tests are organized to find out the surface that is visible from a specified viewpoint.
  • There are two basic approaches for visible-surface determination, as per to whether they deal along with their projected images or along with object descriptions directly. These two approaches are termed as image-space approach and object-space approach, correspondingly.
  • Object space methods are applied in the physical coordinate system wherein objects are explained whereas image space methods are applied in screen coordinate system wherein the objects are viewed.
  • Image-space approach needs examining all the objects in the scene to find out such is closest to the viewer beside the projector passing by the pixel. The visibility is selected point by point at each pixel position upon the projection plane. If various objects are 'n' and the pixels is 'p' after that effort is proportional to n.p.
  • Object-space approach compares each object directly along with each other inside the scene definition and eliminates those objects or portion of objects such are not visible.
  • Object-space approach compares all of the n objects to itself and to another object, discarding invisible portions. Hence the computational effort is proportional to n2.
  • According to this category of Image space approach, we have two methods as:

 

A) Z-buffer method and

B) Scan-line method.

  • In between all the algorithms for visible surface determination, the Z-buffer is maybe the easiest, and is the most extensively used method.
  • Z-buffer method finds the visible surfaces through comparing surface depths as z-values at all pixel positions on the projection plane.

Related Discussions:- Introduction of visible surface detection

De casteljeau algorithm - bezier curves, De Casteljeau algorithm: The cont...

De Casteljeau algorithm: The control points P 0 , P 1 , P 2 and P 3 are combined with line segments termed as 'control polygon', even if they are not actually a polygon although

Dda program to plot line segments, Use DDA algorithm to get the output of y...

Use DDA algorithm to get the output of your program as shown in Figure ANs: Use DDA( ) function to plot line segments that have end points on diametrically opposite points

Basic structures for multimedia interactive applications, Question: (a)...

Question: (a) Sound often gives the only effective way to convey an idea, elicit an emotion, or dramatise a point. Explain two situations of the use of sound that would be con

What is the purpose behind the staircase effect, 1. What is the purpose be...

1. What is the purpose behind the Staircase effect? Ans. The approximation concerned in the calculation for finding of pixel position concerned in the display of lines and th

File formats that are used for vector data, File Formats that are used for ...

File Formats that are used for Vector Data This data can be saved in a wide variety of file formats are as: •EPS: the most well-accepted file format to exchange vector dra

Stochastic animation - computer animation, Stochastic Animation - Computer ...

Stochastic Animation - Computer Animation This utilizes stochastic processes that are a stochastic process can be identified as a random function. Such randomness could be in

Matlab, need help in coding

need help in coding

Application areas of computer graphics, Explain application areas of comput...

Explain application areas of computer graphics in different areas.    Early computer graphics has only certain special capabilities such as straight lines circles and ellipses

Gourand shading, This renders a polygon surface by linearly interpolating i...

This renders a polygon surface by linearly interpolating intensity values across the surface. Intensity values for each polygon are matched with the values of adjacent polygon alon

Problems at shared vertices - modeling and rendering, Problems at Shared Ve...

Problems at Shared Vertices - Modeling and Rendering Shading discontinuities can arise while two adjacent polygons fail to share a vertex which lies along their common edge.

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