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

Computer arthcther, How many 128 x 8 RAM chips are needed to provide a memo...

How many 128 x 8 RAM chips are needed to provide a memory capacity of 4096 16 bits?

Digital signal processing system for an analog signal, QUESTION (a) Dra...

QUESTION (a) Draw and explain the block diagram of a Digital Signal Processing System for an analog signal. (b) Draw the pictorial representation of the signals at each leve

High level techniques - motion specification, High Level Techniques (Motion...

High Level Techniques (Motion Generalized) These are techniques utilized to explain the general motion behavior of any type of graphic object. Such techniques are algorithms o

Properties of bezier curves - modeling and rendering, Properties of Bezier ...

Properties of Bezier Curves - modeling and rendering A very helpful property of a Bezier curve is that it always passes via the first and last control points. Such the bounda

Cases of the sutherland hodgman polygon clipping algorithm, Cases of the Su...

Cases of the Sutherland Hodgman Polygon Clipping Algorithm In order to clip polygon edges against a window edge we move from vertex V i to the subsequent vertexV i+1 and cho

Parallel projection, Parallel Projection In parallel projection, object...

Parallel Projection In parallel projection, objects in scene are projected onto the 2D view plane along rays parallel to a projection vector. Parallel projection is orthogra

Polygonalization of the surface, Remember in polygonalization of the surfac...

Remember in polygonalization of the surface, following rules must be followed. Any two polygons  (i)  share a common edge,   (ii)  Share a common vertext,  (iii)  Arc disj

Liang barsky line clipping algorithm, Liang Barsky line clipping algorithm ...

Liang Barsky line clipping algorithm : The algorithm uses parametric form of the line segment.  Four inequalities are created using the parametric form of the line segments.  Th

Simple graphical user interface, The RIA should consist of: i) A simple ...

The RIA should consist of: i) A simple Graphical User Interface (GUI) constructed from a simple navigation system (comprising of around 5 key frames) making use of the Flash tim

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