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

Crt, refreh buffer

refreh buffer

Liquid crystal display - graphics hardware, Liquid Crystal Display - Graphi...

Liquid Crystal Display - Graphics Hardware It is a type of display utilized in digital watches and several portable computers. These work along with polarized ambient as outsi

Raster and random scan display technologies, Raster and Random Scan Display...

Raster and Random Scan Display Technologies For display or printing graphics objects, various technologies have been invented. Research and development is still on for getting

Viewing transformation, Viewing Transformation In previous section, we...

Viewing Transformation In previous section, we have discussed about the geometric transformations as Translation, Shearing, Reflection, Scaling and Rotation. Rotation, Reflect

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

Modal create, morgen wants to sign up for an account on doggobook, the worl...

morgen wants to sign up for an account on doggobook, the world''s thrid - best social network for dog enthusiasts. she enters her email address and a password into the sign-up form

Seed fill algorithm - output primitives, Seed fill algorithm A seed fil...

Seed fill algorithm A seed fill algorithm starts with a known initial interior point of the polygon and spreads out to determine other interior points to fill the given closed

Scan line algorithm - output primitives, Scan Line Algorithm A scan lin...

Scan Line Algorithm A scan line algorithm determines the overlap intervals of the polygon with each scan line to obtain interior points of the polygon for assigning those point

Define resolution, What is Resolution, how to adjust it.  Resolution: T...

What is Resolution, how to adjust it.  Resolution: The maximum number of points that can be displayed without overlap on a CRT is referred to as the resolution . A more prec

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