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

What is the diameter of screen point - display devices, Question: Suppose w...

Question: Suppose we have a video monitor with a display area measuring 12.8 inches across and 9.6 inches high.  If the resolution is 1024 by 768 and the aspect ratio is 1, what is

Define coherence properties, Define coherence properties?  A coherence ...

Define coherence properties?  A coherence property of a scene is a part of a scene by which relate single part of the scene with the other parts of the scene.

Area subdivision method for hidden surface removal, Q.  Write a short note...

Q.  Write a short note on area subdivision method for hidden surface removal.   Ans. Area Subdivision This technique for hidden- surface removal is essentially an image- spac

Axis of rotation - construction of a solid, Axis of Rotation - Construction...

Axis of Rotation - Construction of a solid with a translational sweep Figure:  (a)                                                                          Figure  (b)

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.

Advantage and disadvantage of plasma panel-graphics hardware, Advantage and...

Advantage and Disadvantage of Plasma panel - Graphics Hardware Advantage 1. Slim design as Wall mountable 2. Larger than LCD screens Disadvantage

B splines, What is uniform rational splines

What is uniform rational splines

Computer animation tools, Computer Animation Tools  To create various t...

Computer Animation Tools  To create various types of animation discussed above, we want to have particular software and hardware as well. Here, the fundamental constraint is re

What is a color management system, QUESTION a) What is a color manageme...

QUESTION a) What is a color management system? Briefly explain how it works. b) What are the three major factors affecting print permanence? c) Briefly explain three ways

Basic approaches for visible surface determination, Basic Approaches for Vi...

Basic Approaches for Visible Surface Determination There are two basic approaches for visible-surface determination, as per if they deal along with their projected images or a

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