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 need of homogeneous coordinates, What is the need of homogeneou...

What is the need of homogeneous coordinates?  To perform more than one transformation at a time, use homogeneous coordinates or matrixes. They decrease unwanted calculations in

Briefly describe jackson''s theorem, Question 1 What is Packet-switching n...

Question 1 What is Packet-switching network? Discuss its basic operation Question 2 Briefly describe Jackson's theorem Question 3 List and explain the two popular

Classification of print finishing processes, Problem: a. Provide exampl...

Problem: a. Provide examples of classification of print finishing processes. b. In advertising, what do you meant by creative strategies? c. Creative strategies are div

Intersection test - visible surface detection, Intersection Test - Visible ...

Intersection Test - Visible Surface Detection Test: It called Intersection Test also: we go for intersection test, if Min-max test fails. Now we take each edge individually

What is meant by addressability, What is meant by Addressability? Ans. ...

What is meant by Addressability? Ans. Addressability is the number of individual dots per inch (d.p.i.) that can be formed. If the address of the current dot is (x, y) then the

What are the advantages of the boundary representation, Advantages of the B...

Advantages of the Boundary Representation (i) This format gives efficient picture generation and easy access to other geometric information. (ii) The changes produced by mos

Objectives-multimedia, Objectives-Multimedia After going through this s...

Objectives-Multimedia After going through this section, you should be capable to: explain hypertext and hypermedia ideas, illustrate how multimedia applications are

Example of bezier curves - modeling and rendering, To prove: P (u = 0) = p0...

To prove: P (u = 0) = p0 Solution : = p 0 B n,0 (u) + p 1 B n, 1 (u) +...... + p n B n, n (u)...............(1)  B n,i (u) = n c i u i (1 - u) n-i B n,0

Phong specular reflection model or specular reflection, Phong Specular Refl...

Phong Specular Reflection Model or Specular Reflection This model of local illumination is frequently termed as the Phong specular reflection model. Here we discuss the matter

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