Subdivision of polygon - visible surface detection , Computer Graphics

Assignment Help:

Subdivision of polygon

Test to find out the visibility of a single surface are made through comparing surfaces that as polygons P along regarding a specified screen area A. There are four types of possibilities as:

i. Surrounding polygon: Polygon which completely comprises the area as in the figure (a).

ii. Intersecting or overlapping polygon: Polygon which intersects the area as in the figure (b).

iii. Contained polygon: polygon which is completely comprised inside the area as in the figure(c).

iv. Disjoint polygon: Polygon which is totally outside the area as in the figure (d).

2279_Subdivision of polygon - Visible Surface Detection.png

The classification of the polygons inside a picture is the major computational expense of the algorithm and that is analogous to the clipping algorithms also. Along with the utilization of any one of the clipping algorithms there a polygon in category two as intersecting polygon that can be clipped into a comprised polygon and a disjoint polygon as in the figure 10. Thus, we could proceed as whether category 2 was removed.

2081_Subdivision of polygon - Visible Surface Detection 1.png


Related Discussions:- Subdivision of polygon - visible surface detection

Positive accelerations - computer animation, Positive Accelerations - Compu...

Positive Accelerations - Computer Animation So as to incorporate increasing speed in an animation the time spacing among the frames should increase, hence greater change in th

Chain of responsibility and the iterator patterns, QUESTION (a) Conside...

QUESTION (a) Consider the observer, façade, chain of responsibility and the iterator patterns. i) Give detailed descriptions and draw their structures. ii) Explain the in

Homogeneous coordinates, What are the uses of homogeneous coordinates? Conv...

What are the uses of homogeneous coordinates? Convert translation rotation and scaling in homogeneous coordinates. In mathematics homogeneous coordinates introduced by August

Algorithms for filled-area primitives, Algorithms for filled-area primitive...

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

Explain how you would create a particle playground effect, Question 1: ...

Question 1: (a) Briefly describe how Parenting could be used in Adobe After effects CS3. (b) Explain the term Vanishing Point and specify when it can be used. Propose how

Graphics tablet - cad and cam, Graphics Tablet - CAD and CAM We need ...

Graphics Tablet - CAD and CAM We need to know what we mean via tablet in computer terminology, before going into details on the graphic tablet, since in the other disciplines

Polygon or area clipping algorithm, Polygon or Area Clipping Algorithm - Su...

Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping,

Basic transformations - 2-d and 3-d transformations, Basic Transformations ...

Basic Transformations - 2-d and 3-d Transformations Consider the xy-coordinate system upon a plane. An object or Obj in a plane can be identified as a set of points. All objec

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