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

Multimedia applications, Multimedia Applications: The term itself clarifies...

Multimedia Applications: The term itself clarifies; this is a combination of various Medias of communication as text, graphic, audio and so on. Currently this field of multimedia i

Relation between polar coordinate and cartesian system, Relation between po...

Relation between polar coordinate system and Cartesian system A frequently utilized non-cartesian system is Polar coordinate system. The subsequent figure A demonstrates a pol

Cases of clip a line segment-pq, Cases of clip a line segment-pq Case...

Cases of clip a line segment-pq Case 1: As we determine a new value of t E that is value of parameter t for any potentially entering (PE) point we select t max as:  t max

Normalization transformation, what is normalization transformation?why is i...

what is normalization transformation?why is it needed and important?give simple example also.

Interactive picture construction techniques, Explain the interactive pictur...

Explain the interactive picture construction techniques.    interactive picture- construction methods are commonly used in variety of applications, including design and painting pa

Computer aided design and drafting, Computer Aided Design and Drafting ...

Computer Aided Design and Drafting CADD or CAD stands for Computer Aided Design and Drafting. This is different from both "draw" and "paint" programs in which measurement is c

Polygon tables - curves and surfaces, Polygon Tables - curves and surfaces ...

Polygon Tables - curves and surfaces All polygons are analogous to a graph G (V, E). Remember that the analogy in which a polygon surface can be specified along with as a set

Example of bezier curves - modeling and rendering, To prove: P (u = 0) = p0...

To prove: P (u = 0) = p0 Solution : = p 0 B n,0 (u) + p 1 B n, 1 (u) +...... + p n B n, n (u)...............(1)  B n,i (u) = n c i u i (1 - u) n-i B n,0

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