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

Containment test - visible surface detection, Containment Test -  visible s...

Containment Test -  visible surface detection Test: That is Containment test: it can be either comprised (contained) or surrounding polygon, if intersection test fails. The

Scan line polygon fill and seed fill or flood fill algorithm, 1.   Distingu...

1.   Distinguish among Scan line polygon fill and Seed fill or Flood fill algorithm? Scan Line Polygon Flood Fill Algorithms ?1. This

Diffuse reflection - polygon rendering & ray tracing methods, Diffuse Refle...

Diffuse Reflection - Polygon Rendering & Ray Tracing Methods It is characteristic of light reflected from a non-shiny, dull surface. Objects illuminated solely through diff

Cases of clip a line segment-pq, Cases of clip a line segment-pq Case...

Cases of clip a line segment-pq Case 1: As we determine a new value of t E that is value of parameter t for any potentially entering (PE) point we select t max as:  t max

Projections - viewing transformation, Projections - Viewing Transformation ...

Projections - Viewing Transformation Specified 3-D object in a space, Projection can be explained as a mapping of 3-D object into 2-D viewing screen. Now, 2-D screen is termed

What is rotation, What is rotation?  A 2-D rotation is completed by rep...

What is rotation?  A 2-D rotation is completed by repositioning the coordinates with a circular path, in the x-y plane by making an angle with the axes. The transformation is g

Basic ray tracing algorithm - polygon rendering, Basic Ray Tracing Algorith...

Basic Ray Tracing Algorithm - Polygon Rendering The Hidden-surface removal is the most complete and most versatile method for display of objects in a realistic fashion. The co

Briefly explain types of animation, Question 1 Briefly explain types of an...

Question 1 Briefly explain types of animation Question 2 Briefly explain steps involved in animation process Question 3 What is Layout? Explain two types of layout

De casteljau algorithm - 2d clipping algorithms, De Casteljau Algorithm ...

De Casteljau Algorithm For computation of Bézier curves an iterative algorithm known as de Casteljau algorithm is used.  The algorithm uses repeated linear interpolation.

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