Computer Graphics: Lecture #19: Sutherland- Hodgeman Polygon clipping

[@shourov3925]

Thank you, ma'am. After watching your example, one confution has been cleared.

[@harshaks7605]

Ma'am you were really awesome in explaining things clearly. Tq so much ma'am.

[@antonymachona]

my fav on the album...
apa mukomana akapemura 🔥🐐

[@udaygupta929]

Perfect example explanation thank you!

[@premkumar-it4ep]

super mam it's very useful for my exam thank you so much

[@jegatheeswaripmc9493]

Hi mam,i have an one doubt, is the case 1 and case 3 are same one ?

[@khossain173]

Madam it would be very helpful if you kindly provide an example with coordinate values.

[@malshikawarapitiya2349]

thank you ❤

[@kikirizki4318]

is sutherland-Hodgeman algorithm the fastest clipping algortihm?

[@soumyaajayan4126]

Nice video mam :) Helpful... I have doubt, In upper boundary edge v3v4 after clipping you written only v3' but in all other cliping and just the next clipping v4v5 you taken v4'v5.Is it a mistake or any other case is there.

[@bekagofariyawu6923]

is that the same to say polygon clipping and polygon splitting?

[@thiagesh4542]

Thank you mam❤

[@Ironman-tq6ju]

Thank u so much mam ❤

[@smeetpanchal8758]

Nice video maam :)

[@sanath4099]

Thank u so much
This is helpful

[@meditationsoothingvideos7106]

Y only V2 in case2

[@techwithnaveentwn]

Appreciated

[@shirinhyder1820]

Useful 👌

[@y.kadharhussan1892]

nice mam

[@giriprasaths1347]

😄Thank You

[@askhere373]

did not understand.
..not clear the topic

[@faymous5045]

Why you dey rush dey talk