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

Homogeneous coordinate systems - 2-d and 3-d transformations, Homogeneous C...

Homogeneous Coordinate Systems - 2-d and 3-d transformations Suppose P(x,y) be any point in 2-D Euclidean (Cartesian) system. In HC System, we add a third coordinate to a poin

Define the term avatars- animation, Define the term Avatars- Animation ...

Define the term Avatars- Animation Avatars are another instance of animation. These are frequently used to represent people either in 3-D (as used in computer games) and in 2-D

Raster scan Display, Draw and explain the diagram of a Raster scan system w...

Draw and explain the diagram of a Raster scan system with a display processor. Explain each unit of the diagram.

Polygon rendering and ray tracing methods, Polygon Rendering and Ray Tracin...

Polygon Rendering and Ray Tracing Methods In previous section we had discussed various methods for visible-surface detection, although in order to produce visibility the prese

Computer aided design and computer aided manufacturing, The development of ...

The development of CAD had little consequence on CNC initially because of the various abilities and file formats used through drawing and machining programs. Conversely, as Compute

Convex shaped window and concave or non convex shaped window, Well you migh...

Well you might surprise to what a convex window? In common, on the basis of the shapes the windows are categorized into two classes: i) A Convex shaped windows: Windows of a s

What is the theory of gestalt, Question: (a) After having worked for s...

Question: (a) After having worked for several years as a graphic designer you decide to start a company of your own; MediaDesign ltd. The most valuable asset of a company is i

Steps of cohen sutherland line clipping algorithm, Cohen Sutherland line cl...

Cohen Sutherland line clipping algorithm The algorithm uses the following main steps Divide the entire plane into nine disjoint regions using the four window boundaries

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