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

Midpoint circle generation algorithm, Midpoint circle generation algorithm ...

Midpoint circle generation algorithm This makes use of a circle function. Based on this circle function, a decision parameter is created which is used to decide successive pixe

Determine general graphics system designed for a programmer, Explain the di...

Explain the differences among a general graphics system designed for a programmer and one designed for a specific application, such as architectural design? Basically, package

Amiga - hardware for computer animation, Amiga - Hardware for computer anim...

Amiga - Hardware for computer animation Originally owned through Commodore, Amiga computers have conduct a position in the computer animation industry for many years. This is

Program to implement procedures or functions, The goal of this assignment i...

The goal of this assignment is to implement procedures/functions using x86 assembly. In addition to implementing procedures/functions, this assignment requires to pass arguments us

What is the purpose of saving selections, Question 1: (a) Once a select...

Question 1: (a) Once a selection is made, what area of the image can be edited? (b) What is the purpose of saving selections? (c) How can you move a selection while you a

Important points about types of light resources, Important points about Ty...

Important points about Types of light resources - illumination model Note: While we see an opaque non-luminous object, we notice reflected light by one surface of the object

Vertices of bezier curve find out 3 points on bezier curve, Specified p 0 ...

Specified p 0 (1, 1): p 1 (2, 3); p 2 (4, 3); p 3 (3, 1) as vertices of Bezier curve find out 3 points on Bezier curve? Solution : We consider Cubic Bezier curve as: P (

Polygon clipping algorithm, Write a polygon clipping algorithm to clip a po...

Write a polygon clipping algorithm to clip a polygon against rectangular clipping are. Read the vertices of polygon to be clipped. 2. Read the coordinates of the rectangular cl

Vecgen algorithm, Working of vecgen algorithm with diagram

Working of vecgen algorithm with diagram

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