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 5t5­ 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

Assumption for diffuse reflection - polygon rendering, Assumption for Diffu...

Assumption for Diffuse Reflection - Polygon Rendering  i) the diffuse reflections by the surface are scattered along with equal intensity in each direction, independent of vie

Combination of positive and negative accelerations, Combination of Positive...

Combination of Positive and Negative Accelerations Actually, it is not that a body once decelerated or accelerated will remain so, although the motion may include both speed-up

Interactive Computer Graphics, Explain the different input modes used in in...

Explain the different input modes used in interactive computer graphics.

Fill in the blanks, a__________of a scene is apart of a scene by which rela...

a__________of a scene is apart of a scene by which relate one part of the scene with the other parts of the scene

Introduction of curves and surfaces, Introduction of Curves and Surfaces ...

Introduction of Curves and Surfaces This section has covered the methods of generating polygons, closed and curves surfaces. Under those methods we have discussed different ty

Differentiate between z-buffer method and scan-line method, Differentiate b...

Differentiate between z-buffer method and scan-line method. What is the visibility test made in these methods? Solution : In depth buffer algorithm every pixel location on the

DDA, limitationsof dda

limitationsof dda

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