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

Education training process, Education training process falls into three gen...

Education training process falls into three general categories: 1) Instructor Support Products: These are used through teachers additionally to text books, lectures and other

Describe fully the term preflight, Question: Adobe InDesign software ...

Question: Adobe InDesign software is used to create works such as posters, flyers, brochures, magazines and books. Designers and graphics production artists are the principa

Explain the fundamental differences of tracking and leading, Question 1: ...

Question 1: (a)Using your awareness of typography and design, make a new logo manually for one of the following. The logo should compulsorily consist of the name and may or may

Positive accelerations - computer animation, Positive Accelerations - Compu...

Positive Accelerations - Computer Animation So as to incorporate increasing speed in an animation the time spacing among the frames should increase, hence greater change in th

Advantages of bresenham’s line drawing algorithm, What are the advantages o...

What are the advantages of Bresenham's line drawing algorithm over DDA line drawing algorithm? DDA and Bresenham algorithms both are efficient line drawing algorithm. Breaenham

Region filling, what is region filling? give details

what is region filling? give details

Archeology-applications for computer animation, Archeology: along with the...

Archeology: along with the advent of the computer, the archeologist has obtained a new tool, computer animation. An object-model can be made comparatively quick and without any we

Z-buffer, describe z-buffer algorithm removing hidden surface

describe z-buffer algorithm removing hidden surface

What is bitmap and what is pixmap, What is bitmap and what is pixmap?  ...

What is bitmap and what is pixmap?  The frame buffer used in the black and white system is called as bitmap which take one bit per pixel. For systems with many bits per pixel,

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