Weiler Atherton Polygon Clipping | computer Graphics Lectures in Hindi

[@afzalmia428]

Are bhai kya samjhai hai thank you

[@deathdevil5046]

Bhai taareef kar rahe ho ya pooch rhe ho. Disadvantages ki jagah advantages bol raha hai clockwise kar rHa hai bol anticlockwise raha hai.

[@jangveersingh6004]

0:51 advantage bolke disadvantage bta rha h

[@jangveersingh6004]

4:02 anticlockwise bolke clockwise bta rha h

[@AmanYadav-jf1yy]

Disadvantages bhai disadvantages 😂😂😂

[@amritaroy1572]

clock wise anticlockwise kuch bhi le sekte hae kya

[@shwetankmishra]

Pass hogaya bro Thanks

[@teknas8750]

Wahh bohot badhiya. Keep it bro 🙇🙇🙇🙇🙇🙇

[@sumi4755]

Sir, please upload Sutherland Hodgeman polygon clipping solved Numerical in which coordinates of polygon and windows are given.

[@iamsourishmittal]

Clip a polygon V1(-100,300), V2(300,700), V3(550,500), V4(70,300) and V5(250,220) with window corner points (100,500) and (400,200) using Weiler Atherton Algorithm. Use liang barskey line clipping algorithm whereever necessory. Write all coordinates of clipped polygon after clipping. Pls answer this, I am unable to get correct answer. This question was asked in my university exam

[@iamsourishmittal]

Clip a polygon V1(-100,300), V2(300,700), V3(550,500), V4(70,300) with window corner points (100,500) and (400,200) using Weiler Atherton Algorithm. Use liang barskey line clipping algorithm whereever necessory. Write all coordinates of clipped polygon after clipping. Pls answer this, I am unable to get correct answer. This question was asked in my university exam

[@icepinkbery2745]

sir , program/source code mil jata bhot acha hota.

[@anchalkapoor2008]

👍👍👍

[@icepinkbery2745]

can you please provide code for this.