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

Panning and zooning, what is zooming and panning in computer graph please e...

what is zooming and panning in computer graph please explan??

Single point perspective transformation, Single Point Perspective Transform...

Single Point Perspective Transformation - Viewing Transformations In order to derive the particular point perspective transformations beside the x and y-axes, we construct fi

Different types of simulating motion - computer animation, Different types ...

Different types of Simulating Motion - Computer Animation Here we discuss different ways of simulating motion as: a. Zero Acceleration or Constant Speed b. No

What colour depths are basically used, Q. What Colour depths are basically ...

Q. What Colour depths are basically used? Basically the number of colours are an exponential power of 2 as for Colour Depth n, colours can be showed. The most popular colour mo

Categories of line segments - 2d clipping algorithms, Categories of Line Se...

Categories of Line Segments It categorizes line segments into three categories (i) trivially rejected (ii) trivially selected (iii) may be partially visible or totally invisibl

Parametric continuity conditions , Parametric Continuity Conditions   To e...

Parametric Continuity Conditions   To ensure a smooth transitions from one section of a piecewise parametric curve to the next, we can impose various continuity conditions at the

What are the advantages of rendering by patch splitting, What are the advan...

What are the advantages of rendering by patch splitting?  i. It is fast-especially on workstations with a hardware polygon-rendering pipeline.  ii. Its speed can be varied b

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

What is persistence and resolution, What is persistence and resolution?  ...

What is persistence and resolution?  The time it takes the emitted light from the screen to decay one tenth of its original intensity is known as a persistence.  The maximum

Explain any ten types of artistic filters, Question 1 Explain any ten type...

Question 1 Explain any ten types of artistic filters Question 2 What is Freehand Tool? Explain the procedure of drawing lines and curves with freehand tool Question 3 Ho

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