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

Characteristics of vector drawings, Characteristics of vector drawings: Ve...

Characteristics of vector drawings: Vector drawings are generally pretty small files as they include only data about the Bezier curves which form the drawing. The EPS-file format

Difference, difference between vecgen algoritham and bresenham''s algori

difference between vecgen algoritham and bresenham''s algori

Cyrus beck algorithm - line clipping algorithm, Cyrus Beck Algorithm - Line...

Cyrus Beck Algorithm - Line Clipping Algorithm Cyrus Beck Line clipping algorithm is actually, a parametric line-clipping algorithm. The term parametric means that we requi

Calculate the entropy of the source, Question 1) Encode the following s...

Question 1) Encode the following string using HUFFMAN ENCODING:                            DO YOU LIKE TINKY WINKY OR EMPTY DUMPTY?     Empty spaces are considered.

Two kinds of video tele conference systems, There are mostly two kinds of V...

There are mostly two kinds of Video Tele Conference systems: 1) Desktop systems are add-ons to normal PC's, transforming them in Video Tele Conference devices. A range of variou

Cohen sutherland line clippings algorithm, Cohen Sutherland Line Clippings ...

Cohen Sutherland Line Clippings Algorithm The clipping problem is identified by dividing the region surrounding the window area into four segments Up as U, Down as D, Left as

Use of interactive multimedia in education, Use of Interactive Multimedia i...

Use of Interactive Multimedia in Education Virtual reality, where 3-D experimental training can simulate real situations. Computer simulations of things too expensive,

Matrix for orthographic projection, Matrix for Orthographic Projection ...

Matrix for Orthographic Projection Orthographic projections are projections into one of the coordinate planes x=0, y=0or z=0. The matrix for orthographic projection on the z=0

B splines, What is uniform rational splines

What is uniform rational splines

Sutherland cohen line clipping algorithm, Describe briefly Sutherland Cohen...

Describe briefly Sutherland Cohen line clipping algorithm.   OR   Describe Cohen Sutherland line clipping algorithm. Cohen Sutherland line clipping algorithm In this algorith

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