You have a great voice! And of course, you have some amazing teaching skills. Cheers to life! And a more simpler approach towards this method will be that whenever we move from outside to inside of the clipping window we follow the polygon boundary or polygon edges. And when we move from inside to outside of the clippling window we follow or trace the window boundary in the 'clockwise direction'.
Hey man, the Wikipedia on this was pretty bare bones and I didn't have enough to go on. After watching your video twice, I completely understood the algorithm and was able to code it up. Thanks a lot!
Hi Arsh deep , the sutherland algorithm saves those 2 points and as the algorithm dictates the points inside the clip window have to be connected, so we get the extraneous line in case of concave polygons !
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
DOUBT..!!! So in the sutherland hodegenam polygon clipping I2 I3 should not be included. In Weiler Atherton approach after clipping, what about lines I1 I3 and I3 I4.??? should they be included?
You have a great voice! And of course, you have some amazing teaching skills. Cheers to life!
And a more simpler approach towards this method will be that whenever we move from outside to inside of the clipping window we follow the polygon boundary or polygon edges. And when we move from inside to outside of the clippling window we follow or trace the window boundary in the 'clockwise direction'.
Very few videos are available on this topic and this one is the best. Thanks.
Too good sir, it helped great the night before exam...
Thank you
as we always study right before the exams ;)
Hey man, the Wikipedia on this was pretty bare bones and I didn't have enough to go on. After watching your video twice, I completely understood the algorithm and was able to code it up. Thanks a lot!
incredible, you didn't have the thick accent i expected and i was able to listen to your explanation and learn the algorithm
Thank you sir🙌🏼. Really appreciate the help.
You have a great voice 🙂
Hi Arsh deep , the sutherland algorithm saves those 2 points and as the algorithm dictates the points inside the clip window have to be connected, so we get the extraneous line in case of concave polygons !
Great explanation sir 🙌🏼
Far better than my graphics teacher ❤❤
Really useful for weiler atherton algorithm understanding
thanks a lot , you taught me in almost 9 min what my teacher could in 50 min
+Saleh s haha :) You just made my day bro!
Thanks Buddy....It was really quick ,helped me in saving time during exams..
+Saurav Sagar
Thank you :)
Thanks buddy....the way you simplify the topics is actually awesome. Please keep it going... :-)
Nice video.Thanks for the explanation.Pretty clear and to the point.
Abhimanyu Singh sure thing buddy :) Thank you for letting me know. It keeps me going!
Sir, you are great. You are the best.
Very good explanation
Great video!!
Hungry for more
Great video! Thank you so much!
i understood it in 1 explanation.. thanx bro..
Sir, you made it so easy....just love the way you teach😊
Thank you so much for this in depth tutorial. I am going to use this math for collision detection in my 3D program.
did you finish working on your 3d program
It really Helped me
Thank you🙏
Explanation was really good.
Thank you so much for the video....no need of any other explanation.❤️❤️
Thank you so much for making this video! helps a lot!
Awesome way of teaching
thank you so much it helps me alot at the last moment hahah because its the last night before exams
Great explanation👍🏻👍🏻👌🏻👌🏻
Thanks a lot sir.....your way of explaining is just outstanding 👍🏻👍🏻👍🏻🙏🏻🙏🏻🙏🏻💯💯💯
Very Nice Explaination
+Raghu Nathan thank you brother !:)
very nice and easy to understand.
excellent explanation.
+Kashif Amin
Thank you :)
Helpful specially at last moment
The video was very helpful
It did help me a lot. Thanks!
:D
Crystal Clear Explanation.........
make these algo's so interesting and easy.................keep it up!!
Great video! Crystal clear.
thank you sir and you have a good explanation skills.
very well explained
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
very good explanation of weiler atherton polygon algo. Plz explain Laing-Barksy method.
Why does your videos don´t cover various cases in concave polygon ?
sir, how about making a video on Nicholl lee nichol line clipping algo!
Yes.. no proper video of NLN is present on youtube.
I need it too
There is no vedio regarding Nichols -lee-Nicholl line clipping algo
very nice...well explained
Very hard work and very well u teach that topics i loves it so much ..plz upload more videos bro and well work keep it up
Great video! Thanks!
+Pallavi Jha thank you. Appreciate it !
thank u ,a very clear concept......
+murli varma
Thank you :)
Your video helped alot👍
Thank you sir , really amazing 💯❤️
great video helped alot thank you!
Very thank you sir, it helped me much
Thanks ,nice explanation.
plz tell me how u choose a clip points.
Thanks bro...well explained🤗
very well explained!!
+Rashika Jain
Thank you :)
great work👍🏻👍🏻👌🏻👌🏻
Nice video..good explanation
Thanku so much sir for this video
very easily explained
seriously helpful!!..thanks a ton..
Good Explanation! Need video on Liang-Barsky line clipping algorithm
well explained man... thanks :)
+navaneet kumar
Thank you :)
Is this method used for unions of polygons? Is there a better approach for unions of three dimensional objects?
How will i1-i2 and i3-i4 included?
just perfect...
Good explanation bro
Great video
nice work bro
hey i don not find Mid Point subdivision algo.
if possible plz do help with a video.
else other videos explained well thanks.
nice work
nice explanation
great explaination!!!
hi can you make a video explaining cyrus beck line clipping algorithm??
very nice video! would love it if you could make others too, like the cyrus beck line clipping which I find pretty badly explained on the internet
+OvidEx44 sure, I'll do it as soon as I get some time :)
sir in what order we take intersection point in clip column
plz make video of Liang barsky line clipping algorithm
To the point explanation.
how do you handle the cases when two edges are colinear?
shapeare1 edges can't be collinear. Lol it would be considered as one edge only.
can you please provide code for this.
Lovely vedio sir
Too good 💯💯
Amazing!
Sir, plzz make a video on nicholl le nicholl clipping algorithm..
DOUBT..!!! So in the sutherland hodegenam polygon clipping I2 I3 should not be included. In Weiler Atherton approach after clipping, what about lines I1 I3 and I3 I4.??? should they be included?
Need video regarding Laing Brasky Line Clipping Algorithm
+Raghu Nathan that doesn't seem like a tough task at all. Surely will upload as soon as I get some time!:)
big help thank you
Thank you :)
shabash londe
excellent
superb
God bless you
Who else checked their iPhone when they heard the notification bell during the video?
Only you XD
aditya kiran Hahahaha😂😂
Only you
wow ur jst sooooo good thank u :)
+princess bloom thank you Princess!
Thanx arihant sir
Really appreciate the work. It helped my coursework :D
+Mengxin Xu
Thank you :)
Just awesome !!!!!
Great Video . Just i need video in the topic Laing Brasky Line Clipping Algorithm
Thanks a lot bro!!!
Sir, plzz make a video on edge table too...
Thank you