Computer Graphics : Sutherland-Hodgman Polygon Clipping Algorithm Thanks again for watching ! If you liked it pls make it a point to comment below. Keeps me going :)
Пікірлер: 158
@rishabsingh24757 жыл бұрын
an entire lecture thing in just 8 min. just wow. much helpful thanks a lot .
@FPChris2 жыл бұрын
You didn’t explain how you clipped the low left corner. V5’ would wrap to V3’ not magically magically create the corner.
@yetanother7428Ай бұрын
I was thinking the same thing. (Also, I think you meant V2', instead of V3'). This video is wrong. If anyone is looking around, to save time, I found a video with the correct explanation of the algorithm: kzfaq.info/get/bejne/e9ulqppjvtPZYIE.html
@CMSARAN4 жыл бұрын
The video was an good guide for me during my semester exam i thank you for your help and i request you to upload this kind of video with updated version of items frequently EVERY ENGINEER SHOULD WATCH
@nabeelrao26387 жыл бұрын
I have an exam tomorrow and wasn't being able to understand this from the book. But now i clearly understood it. Thanks a lot for this informative video!!!
@anushkamittal41326 жыл бұрын
Amazingly clarified..I must appreciate your way of teaching so politely . Thankyou so mch sir 😇
@talsveta9 жыл бұрын
Another scenario should be taken into account is the case when both vertices are outside the clipping area, while the line they form *does* cross the clipping area. I guess in this case you should not discard both v1 and v2
@TheBootStrappers9 жыл бұрын
talsveta yeah in that case you have to assume a point on the line crossing as a vertices of the polygon(hypothetically) and then break that line into the cases mentioned in the video. Thank for pointing it out though:)
@arpanmajumder6557 жыл бұрын
Yeah,I was also thinking the same! Great tutorial otherwise!
@pe_P2 жыл бұрын
Thankyou for the lecture..👍 And your voice is so beautiful🌝
@umangpancholi58883 жыл бұрын
Thanks a lot! Also, your voice is brilliant XD
@markwoo98458 жыл бұрын
good tutorial for Sutherland-Hodgman Algorithm. thank you, you really help me a lot
@TheBootStrappers8 жыл бұрын
+Mark Woo Thank you :)
@dhruvtonemare84734 ай бұрын
Thank you sir simple and easy video with kind understanding ❤😊
@ostaphrytsyshyn31998 жыл бұрын
Considering points as "inside" and "outside" will not work in all cases. Check this image. i.imgur.com/e6S0V20.png Segment ED is intersecting rectangle, but nither E nor D is inside the rect.
@jinxblaze8 жыл бұрын
+Ostap Hrytsyshyn yup
@anshulhedaoo83326 жыл бұрын
did you get any solution of this bro???
@LionKILLGER6 жыл бұрын
The solution is to NOT check the 4 cases according to the rectangle but according to the clipping edge I guess. If you have a closer look at the pseudocode provided by e.g. wikipedia ( en.wikipedia.org/wiki/Sutherland%E2%80%93Hodgman_algorithm#Pseudo_code ) you quickly see that one has to pick an edge of the clipping polygon. E.g.: Take the 1. Clipping Edge (e.g. left edge) -> now take as input points all points of the polygon and check the 4 cases against this edge -> i.e. if its left of the edge -> its outside, if its right of it -> its inside -> add the new intersection points like the cases tell you and you get a new list L' -> you take that list as the input list for the next iteration Take the 2. Clipping Edge (e.g. top edge) and as point input list L' from the previous iteration. -> now perform the same steps as before and get the next output list L' ... continue this procedure for the other 2 edges of your rectangle. I think following the steps like I wrote will indeed capture the edge by E and D. ( Please correct me if I am wrong because I also need to know the correct solution :D )
@simranguliani16093 ай бұрын
would be great if you have given these in written points,but it was such an easy explanation ,thanks
@mikhailsartakov4750Ай бұрын
Brilliant video!
@varshathaya25156 ай бұрын
very understandable. Thank you 🙏
@ashwaniprasad73818 жыл бұрын
Just in one word "AWESOME"
@TheBootStrappers8 жыл бұрын
+ashwani prasad just in two words "THANK YOU"
@akanshachaurasia33296 жыл бұрын
I really liked your lectures they are very beneficial..... I request you to pls upload more videos on computer graphics
@AndrewJoemon3 жыл бұрын
thank you for this video... wonderful explanation..
@Aziz007479 жыл бұрын
Thank you so much! really well explained! God bless u!
@ruxandraciortea94752 жыл бұрын
thank you sir, very nice explanation! very useful!
@amaanhamza17765 жыл бұрын
Tmaari awaaaz, uffff, agar natural hai to im sorry, or ye jaanke istarah ki nikaal rhe ho to, katai jeher ho tum
@abishekh_kc5 жыл бұрын
thanks buddy... well explained without any doubts.
@talsveta9 жыл бұрын
Thank you very much! It was great and well explained! Just one other note - I think the last edge you made between the vertices v5' and v3' is not trivial and worth to mention.. I.e. if those vertices had not been signed with a dash, you would have needed to connect them with one direct edge and not over the actually 2 edges that are formed by the surroundings of the clipping area
@TheBootStrappers9 жыл бұрын
talsveta sure thanks !
@parvinderyadav0078 жыл бұрын
+talsveta Yess you are right ! i think that's the small mistake done by talented buddy :D
@ashankavindu2409 Жыл бұрын
Thank you very much sir ❤️❤️❤️❤️
@journeytolive83868 жыл бұрын
their is a confusion between inside to outside point. which one we have to take you didnt mention in the lecture......
@abrahamjoseph6445 Жыл бұрын
I like to point out a small mistake in in 4 th example The clipping from inside to outside we have to save the inside point v1dash instead of v2dash
@arpityadav18475 жыл бұрын
Nice explanation
@omarmoataz8 жыл бұрын
This was great, thanks.
@prateekparabify9 жыл бұрын
Very nicely explained . very precise
@TheBootStrappers9 жыл бұрын
prateek parab thank you brother
@this_rishi6 жыл бұрын
Thanks a lot for the video... It was really helpful.
@Xaknoth8 жыл бұрын
How does this algorithm handle the case when one or more corners of the rectangles is part of the clipping? You just included the corner without any explanation in the example you solved. One other case that is not handled is when both v1 and v2 are outside the clipping window but the edge between them intersects the clipping window.
@ayeshaparyani15498 жыл бұрын
To solve your first query, a corner of the window is supposed to be within its boundaries. So it's treated as 'inside'. For your second question, Sutherland Hodgeman polygon clipping algorithm clips a polygon with respect to one boundary at a time. So you actually need to repeat this four times for a rectangular window. In the video, he has tried to solve it in one go which would create confusion. I suggest you solve this case considering one boundary at a time. It definitely works. However be careful that you figure out 'inside' and 'outside' vertices considering only the boundary then and not the entire polygon.
@ayeshaparyani15498 жыл бұрын
Not the entire window* i mean
@renzocoppola46647 жыл бұрын
it works if you repeat the process in EACH edge-boundary, not everything at once.
@zandere15 жыл бұрын
@@renzocoppola4664 Yep, and you have to treat them as infinitely long
@filat2393 жыл бұрын
I like that. Well explained!
@VarshaGupta-ku4ez7 жыл бұрын
please upload the video of midpoint circle drawing algorithm
@kladimirovo9 жыл бұрын
very good explanation, thanks
@TheBootStrappers9 жыл бұрын
Kladimir happy to help!
@teemaroronoa93848 жыл бұрын
Was useful and helpful
@rajeshprajapati6662 Жыл бұрын
08:22 So, initially this polygon had 5 sides. After clipping, the polygon has 7 sides. Right ? or is it 6 ?
@abhishek1verma6 жыл бұрын
very good explanation
@priyanka91336 жыл бұрын
Thankyou very much....😊
@kaltwarraith51722 жыл бұрын
very useful, one note, what you pronounce as v1 dash is more commonly called v1 prime
@allurunsprasad90998 жыл бұрын
it really helped me.. thanks a lot man
@krcreddy16717 жыл бұрын
excellent video bro. nice keep it up...
@thangklen7 жыл бұрын
when V1 goes from outside to inside V2, the intersection is actually V1', not V2'
@BhupendraChoudharyczar7 жыл бұрын
best video on SHPCA...
@DayIight.2 жыл бұрын
Legend
@sahirsharma45413 жыл бұрын
Good job!
@apurbaghosh48568 жыл бұрын
thanks for the video. it helped a lot.
@kumarabhishek47358 жыл бұрын
very nice mann
@Alex-vi6fr6 жыл бұрын
how can you tell the direction of the line when the question is not given any direction at all? :/
@abhinavnarendrakumar5915 жыл бұрын
Great tutorial, very helpful
@vibecatcher44164 жыл бұрын
Wow , amazing sir ,, thank you 🙏🏻
@jarikosonen40793 жыл бұрын
This looks like something to test. What would happen if there is a hole in the polygon? Looks like O^2 problems. If v1&v2 both outside, but their segment crossing the corner?
@ahmedal-ahmed76067 жыл бұрын
Excellent Video , Thanks Bro (Y)
@runasing32937 жыл бұрын
please upload 2-D and 3-D transformation lecture too....its helping a lot
@anmolmangat91286 жыл бұрын
I have watched a few videos of this channel and they are amazing You should publish a full fledged course on Computer Graphics as there is no good source of it on youtube Videos were
@ganeshkolase72036 жыл бұрын
Nice explanation.. keep it up👍👍👍👍
@zlayaprizlaya7 жыл бұрын
What about the case if all points are outside the window and window is completely inside the polygon?
@fasalurahman6974 жыл бұрын
Simple mistake last step V5 -V1 not V5' its (V1') Good work bro..
@cristinjhon84444 жыл бұрын
How did you determined the inside and outside points !!!!!!say it first
@kumaripuja74338 жыл бұрын
U said for 'inside to outside' that we consider the outside point but while solving problem u saved the inside point.... So which one we hv to save???
@kshitijmakwana97079 жыл бұрын
there seems to be a minor error at time 3:40 in video for rule 'd' as you ask us to save v2' but while solving the sum you consider points v1' as at 6:55 you take point v5' instead of v1' oh !! and love your videos................Good Job :) couldnt find for liang barsky algorithm though please share the link unless you havent made one if so please make one THANK YOU
@singhkamalpreet9 жыл бұрын
+Kshitij Makwana sahi a 22
@ankitambekar60736 жыл бұрын
Good Job..
@shadizebari81619 жыл бұрын
what about if we have a non-rectangular clipping window?
@grinalpatel10128 жыл бұрын
Well understood…plz Post liang barsky line clipping
@Niteshkumar-zd3kr5 жыл бұрын
The polygon you have used for clipping is a concave polygon!!
@hiteshpanjwani16136 жыл бұрын
Gr8 one dude
@manognamona99595 жыл бұрын
In the rule 4 sir u have mentioned v1 inside and v2 outside and we must save v2' in the polygon example the line from v5 to v1 ,v5 is inside and v1 is outside according to rule 4 v1' must be saved but sir y did u mentioned v5'
@sagarmukherjee62977 жыл бұрын
its wrong the last part v2' should be connected to v5' directly how can a line bend between to point in clipping
@d.j.peters8 жыл бұрын
It will fail if v0 ,v1,v2 (a triangle larger as the clip rectangle) all outside the 2D screen rectangle or 3D view frustum.
@AryanSingh2512.5 жыл бұрын
DJLinux007 that’s why we have another algorithms.
@vinothkumar79 жыл бұрын
Is the algorithm is will work for all complicated shapes??? Or only works on any shapes clipped by rectangle shape??? @The BootStrappers
@antraverma66718 жыл бұрын
window is nt visible... :/
@jaiminmistry52408 жыл бұрын
how can you go vertical form v2' and then horizontal ??( 8:00) Vertices of the square polygon have not been saved.
@Mahadeva...5 жыл бұрын
U have nice communication skills though... And very nicely presented... 👍👌
@trg3-1495 жыл бұрын
realy helpfull for me! thanks
@initpwn7 жыл бұрын
+The BootStrappers, 8:01 tho,... That v2' & v5' should be joined connected directly... Right? :\ Anyway, awesome presentation... really helped me! :) :')
@abhaychandrasingha34486 жыл бұрын
awsome video
@abuelkheirshorts2522 жыл бұрын
thanks brother
@bhavyagosalia48905 жыл бұрын
thanks mahn ....helped a lot
@harshpreetbakshi89358 жыл бұрын
nice explanation...
@sanduferi32255 жыл бұрын
God bless you !
@cristinjhon84444 жыл бұрын
There is some mistake in this video!!!!! V3 to v4 there should be saved v4' but you saved v3' and there is also mistakes in v5 to v1
@iyapa889 Жыл бұрын
yes how can we save that point ?
@ashishmaxmaxal3127 жыл бұрын
Can we start from any vertex of polygon? or what would be the direction to move (clockwise or anti.C)?
@saisaran18828 жыл бұрын
well explained.... also post liang barsky algo...pls...
@1step4ward968 жыл бұрын
really helping tutorial... thankyou (y)
@TheBootStrappers8 жыл бұрын
Thank you :)
@mohamedhossam9215 жыл бұрын
i think according to rules when goes from v3 to v4 we make v4' so how we make 2nd V4' when we go from v4 to v5 that should make also V4' that will make 2 v'4 ???
@minhajuddindanish21674 жыл бұрын
It's awsm bro
@renzocoppola46647 жыл бұрын
joining the end points? you mean to reiterate the algorithm?
@renzocoppola46647 жыл бұрын
Uhm, no. You know about this case after checking if it's two sides off
@sohammondal5789 жыл бұрын
Look the video is very good but there was a problem in the sheet 3 where you did not draw the window..How are gonna know if the line is going in or out if you dont show the window ?
@TheBootStrappers9 жыл бұрын
Soham Mondal sorry buddy I'll take care of it next time!
@sohammondal5789 жыл бұрын
yes,plz !!
@naimaakther2596 жыл бұрын
Thanks
@devkaran14488 жыл бұрын
Please upload Liang barsky algorithm
@mayurinegi96246 жыл бұрын
Isn't the last point which you saved, suppose to be v1'?
@akshaaaaaaaaaaaaaaay7 жыл бұрын
At 3:50 it should be v1 dash not v2 dash. Thnx for great lec.
@sushmitaroy96847 жыл бұрын
thank you
@ElChavale5 жыл бұрын
Which is the link for line clipping?
@mdsayedahammed23677 жыл бұрын
Amazing !!
@bonny271966 жыл бұрын
Awesome
@aadarshgupta22537 жыл бұрын
You have to follow LRBT. Otherwise you can't say about the v2' and v1'.
@anantsoni63356 жыл бұрын
Helpful.....
@FurqaanShafi5 жыл бұрын
thanks broda!!!
@sunny105289 жыл бұрын
After clipping , in the final diag you didn't name the vertex between v2' and v5' What about that?
@tirtha2chester9 жыл бұрын
SAYAN BOSE bhaaiiii aar poris na
@christopherlusiga21127 жыл бұрын
Thank u bro
@shubhammittal51647 жыл бұрын
Hehe In the end, V2' and V5' ke centre wala point kaise liya ?
@blackaura3459 жыл бұрын
Concise explanation, sir. But be a bit fast.
@TheBootStrappers9 жыл бұрын
blackaura345 sure ! Will take note of it in the upcoming videos
@halfway169 жыл бұрын
The BootStrappers This is a good tutorial bro, no need to be faster because there is some people who dont understand english well.. Keep the good work!!