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 5t5­ 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

Computer arthcther, How many 128 x 8 RAM chips are needed to provide a memo...

How many 128 x 8 RAM chips are needed to provide a memory capacity of 4096 16 bits?

Space exploration-applications for computer animation, Space Exploration: ...

Space Exploration: now, the farthest point far away from earth which the human was on the moon, although we continually want to learn more. A trip by a human to the other planet w

Design a game using graphical user interface, BlackJack is a popular card g...

BlackJack is a popular card game played in many casinos. The player plays against the dealer aiming to reach 21 points, or a score higher than the dealer without exceeding 21. The

Exceptional cases - orthographic projection, Exceptional cases - Orthograph...

Exceptional cases - Orthographic Projection 1)   We have an Orthographic projection, if f=0, then cot (β) =0 that is β=90 0 . 2)   β =cot-1 (1)=450 and this Oblique projec

Polygon clipping - raster graphics and clipping, Polygon Clipping - Raster ...

Polygon Clipping - Raster Graphics and Clipping After considerate the idea of line clipping and its algorithms, we can currently extend the idea of line clipping to polygon cl

Ray tracing - polygon rendering and ray tracing methods, Ray Tracing - poly...

Ray Tracing - polygon rendering and ray tracing methods "Ray tracing" is a technique of following the light by the eye to the light source. While ray casting only relates its

Bitmap graphics, Bitmap Graphics: The information below illustrates bitmap...

Bitmap Graphics: The information below illustrates bitmap data. Bitmap images are a set of bits that form an image. The image comprises a matrix of individual dots or pixels wh

Constant intensity shading or flat shading, Constant intensity shading OR F...

Constant intensity shading OR Flat shading  In this technique particular intensity is calculated for each polygon surface that is all points that lie upon the surface of the

Video conferencing and virtual reality, Video Conferencing and Virtual Real...

Video Conferencing and Virtual Reality Virtual reality is a truly fascinating multimedia application. In such, the computer creates an artificial environment using hardware an

Steps of cohen sutherland line clipping algorithm, Cohen Sutherland line cl...

Cohen Sutherland line clipping algorithm The algorithm uses the following main steps Divide the entire plane into nine disjoint regions using the four window boundaries

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