Polygon clipping algorithm, Computer Graphics

Assignment Help:

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 clipping area against which it has to be clipped. 3. Considering the edge of rectangular area one at a time we apply the following algorithm. 4. /* p is the input vertex, vertex under consideration S is the previous vertex. F is the first point. E is the edge under consideration (of rectangular 7 area against which it has to be clipped) */ Input vertex P 5. If P is the point store it in a variable say F and proceed to step 7. 6. If P is not the first point then if edge 5t intersect edge E under consideration. Computer the intersection point 1 Output vertex 1 else proceed to step 7. 7. Store P in variable S (S=P) 8. If S is on left side of edge E output vertex S. 9. Repeat steps 4 to 8 till all the vertices are processed 10. /* for closing polygon */ if 3f intersect E Computer intersection point 1 output vertex 1 11. Repeat the above steps (4 to 10) with new output polygon obtained from step 10 for other edges of rectangular area under consideration. 

 


Related Discussions:- Polygon clipping algorithm

Illustrate the advantages of using virtual reality, Illustrate the Advantag...

Illustrate the Advantages of using virtual reality - it's safer (As techniques can be tried out in advance without the dangers of real operation for example maintaining a nucle

State the advantages and disadvantages of CAD, State the Advantages AND Dis...

State the Advantages AND Disadvantages of CAD       Advantages of CAD                                                               Disadvantages of CAD - Easier to modif

Jpeg graphics, JPEG Graphics: Another graphic file format usually utilized...

JPEG Graphics: Another graphic file format usually utilized on the Web to minimize graphics file sizes is the Joint Photographic Experts Group that is JPEG compression scheme. Not

Graphics applications, The subsequent are also considered graphics applicat...

The subsequent are also considered graphics applications as: • Paint Programs: Permit you to create rough freehand drawings. The images are saved as bit maps and can simply be

Liang b arsky line clipping algorithm, Write the Liang B arsky line clippin...

Write the Liang B arsky line clipping algorithm. Why is Liang Barsky algorithm more efficient than the Cohen Sutherland algorithm?  Liang Barsky Line Clipping: Faster line cl

Acquire the perspective transformation, Acquire the perspective transformat...

Acquire the perspective transformation onto z = - 2 Plane, where (0, 0, 18) is the center of projection. Solution: Now centre of projection, C (a, b, c) = (0, 0, 18) ∴ (n 1

Projections - viewing transformation, Projections - Viewing Transformation ...

Projections - Viewing Transformation Specified 3-D object in a space, Projection can be explained as a mapping of 3-D object into 2-D viewing screen. Now, 2-D screen is termed

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

Light pen - input and output devices, Light Pen - input and output devices ...

Light Pen - input and output devices It is a pointing device. This has a light sensitive tip that is excited while the light is emitted and an illuminated point upon the disp

Line clipping algorithm - cohen sutherland algorithm, Line Clipping Algorit...

Line Clipping Algorithm - Cohen Sutherland Algorithm Line is a series of endless number of points; here no two points contain space in among them. Hence, the above said inequa

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