Sir, last sem due to you alone I survived algorithms. Now it seems you will help me survive Graphics as well. I desperately wish all teachers could explain like you!
I am sorry on 35:56 ... P=2dy-dx.... not p=2dx-dy .... This lecturer is greater than attending my normal class. Thank you... Also you are my great lecturer of Analysis of Algorithm. I have knowm TIME COMPLEXITY because of you only... THANK YOU!!
After 35;56 ,we will take dy,ex in if and else block as well. Because sir there is no variable in the algorithm as you have written in algorithm in if and else block ∆x, ∆y
I have learned so much from you... cant thank you enough! I got your c++ course a while back, and just got your data structures course now. Cant wait to start :)
Great explanation. Thanks. @24.31 you should not skip that term as it will be needed to define the sign. However, in calculation of P[k+1], you will not need it as it is defined in terms of P[k] and P[k] takes care of this constant term.
Dr. Breshingham was impressed with my graphics programming back in the late 80s. He came to visit the IT department at Coastal Carolina. Never forgot that. He lives in Rock Hill or did at the time.
These explanations are so clear because of the background order you follow Sir. Once we learn from you, we are less likely to forget because we know "why" it was done :) Thank you very much!
Fantastic. I thought I was going to have to derive this by myself as I only seen superficial descriptions on other videos. A full and complete derivation with example. Nice. Very pleased that I found this video.
Yesterday only I saw ur DDA line drawing algorithm video for the first time.. Ur way of explanation helps me to understand the concept well.. Thank you sir.. Pls make more videos based on circle and ellipse generating algorithms, 2D geometric transformations, matrix representations, 2D viewing in graphics..
One of the best explanations and instructors in the web. He has additional C++ courses and algorithms in C++ courses which are one of the best in the net.
You're correct. He should have given this clarification. Otherwise it's very confusing. Also at 29:41 it should be Pk >= 0 instead of P next - Pk >= 0.
@@praveensharma4014 I took like 1 hour to get around how Pnext - Pk < 0. I think he was trying to say, Pnext - (pk if less - 0) and Pnext - (pk if greater or equal to 0).
from 24:18 there appears to be a redundant explanation about constant which confused me. P[k] needn't change at all. and if condition of 29:46 should be just whether P[k] is negative or positive to be clear. overall, thank you for your video.
Sir, I am interested in computer graphics. I love your lecture very much. Your lecture is very comprehensive and easy for me to understand. Please keep on making similar video, thanks!!!
This was very helpful and easy to understand video...thankyou sir❤. Can you plz make a playlist on computer graphics and multimedia subject. I literally understood the algorithm in one go..🙌🙌
Very helpful. I had to create a vision check system on a 2D grid on a game I was working on, based on this algorithm. First I tried with wikipedia, and found out that the pseudocode there is incorrect. This video helped me to understand how the algorithm works. Once I found out is was trivial to tweak it for all 4 octants. Thank you very much.
Sir pls make some vedios on midpoint circle drawing algorithm and midpoint ellipse drawing algorithm am really waiting for ur lecture in a short period of time
at 31:19 he said if pk < 1 we follow first one, but see as we know if pnext-pk < 0 we follow this, how pk be less than zero now...? have you understood this?
Thank you sir....for great explanation....plz make videos on other graphical theorem's like polygon filling and boundry fill algorithm.....plz sir...my exams are starting from 30 March.....plz help me sir....
28:29 Why Pk+1 - Pk < 0 means we stayed on the y value.Why it means that we were not incrementing? I cannot catch that. Why didn't u write that if Pk < 0 then we do something and if Pk > 0 then we do something. What is about this Pk+1 - Pk < 0?
sir you are really great .........your teaching influence every students........I was totally satisfied with your lectures......i hope you will make more videos in computer graphics too
For anyone trying to figure out how to implement m > 1, here is a c++ implementation i created from the pseudo code on the wiki Just replace all the classes that's not found(like vector and color, these are classes i created) void DrawPane::renderLine(Vector2f a, Vector2f b, int color) { if(abs(b.getY() - a.getY()) < abs(b.getX() - a.getX())){ if(a.getX() > b.getX()){ renderLineLow(b, a, color); }else{ renderLineLow(a, b, color); } }else{ if(a.getY() > b.getY()){ renderLineHigh(b, a, color); }else{ renderLineHigh(a, b, color); } } } void DrawPane::clearCanvas() { std::fill_n(m_canvas_data, m_width * m_height, 0); } void DrawPane::renderPolygon(Vector2f f, Vector2f f1, Vector2f f2) { renderLine(f, f1, Color::RED); renderLine(f1, f2, Color::GREEN); renderLine(f2, f, Color::BLUE); } void DrawPane::renderLineLow(Vector2f a, Vector2f b, int color) { float dx = b.getX() - a.getX(); float dy = b.getY() - a.getY(); float p = 2*dy -dx; float i = 1; if(dy < 0){ dy = -dy; i = -1; } int y = a.getY(); for (int x = a.getX(); x < b.getX(); x++) { m_canvas_data[y * m_width + x] = color; if (p > 0){//Set bottom pixel p -= 2*dx; y += i; } p = p + 2*dy; } } void DrawPane::renderLineHigh(Vector2f a, Vector2f b, int color) { float dx = b.getX() - a.getX(); float dy = b.getY() - a.getY(); float p = 2*dx -dy; float i = 1; if(dx < 0){ dx = -dx; i = -1; } int x = a.getX(); for (int y = a.getY(); y < b.getY(); y++) { m_canvas_data[y * m_width + x] = color; if (p > 0) {//Set bottom pixel p -= 2*dy; x += i; } p += 2*dx; } }
@@abdul_bari Thank you Sir for replying me. Sir I have searched and look at some videos too, but I didn't understand it correctly. Because they are not explain it in deatils. And I have exam in one Week. Thank you
at 31:19 he said if pk < 1 we follow first one, but see as we know if pnext-pk < 0 we follow this, how pk be less than zero now...? have you understood this?
Sir, last sem due to you alone I survived algorithms. Now it seems you will help me survive Graphics as well. I desperately wish all teachers could explain like you!
Bro i have sem exams can you suggest some good youtube channel for computer graphics please reply bro i don't know anything for exam
@@abc-ym4zs ruclips.net/p/PLYwpaL_SFmcAtxMe7ahYC4ZYjQHun_b-T
@@abc-ym4zsdid you found any?
@@abc-ym4zs 5 minutes engineering is a great channel for studying CG
@@abc-ym4zs1$11
This is the best so far I have seen on Bresenham's algorithm explanation. You deserve an accolades👍
I am sorry on 35:56 ... P=2dy-dx.... not p=2dx-dy .... This lecturer is greater than attending my normal class. Thank you... Also you are my great lecturer of Analysis of Algorithm. I have knowm TIME COMPLEXITY because of you only... THANK YOU!!
This took me 3 hours to figure out ':D
this is a error right? its always P=2dy-dx
After 35;56 ,we will take dy,ex in if and else block as well. Because sir there is no variable in the algorithm as you have written in algorithm in if and else block ∆x, ∆y
Yes, it is an error.
Yes! There was an error but if you take a look at 38:06 the code is corrected.
I have learned so much from you... cant thank you enough!
I got your c++ course a while back, and just got your data structures course now. Cant wait to start :)
Where did u get the course from
@@princegirish1991 See the description.
@@SATYAMYADAV-xy3mx support Mr. Bari buddy
People like you are blessed with a beautiful skill, "Teaching". Thanks for being such a good teacher to all of us.
Great explanation. Thanks.
@24.31 you should not skip that term as it will be needed to define the sign. However, in calculation of P[k+1], you will not need it as it is defined in terms of P[k] and P[k] takes care of this constant term.
Dr. Breshingham was impressed with my graphics programming back in the late 80s. He came to visit the IT department at Coastal Carolina. Never forgot that. He lives in Rock Hill or did at the time.
Sir ,pls make more videos on computer graphics ...
These explanations are so clear because of the background order you follow Sir.
Once we learn from you, we are less likely to forget because we know "why" it was done :)
Thank you very much!
Algo explaination starts at 14:46 . Thank me later
thanks bhai
thanks, bro
thanks fam
thnx buddy
My hero
sir, literally you are the most amazing teacher of all the teachers I have seen on youtube.thank you very much sir for your efforts
I've been frustrated with this concept for a bit, but you're explanations are fantastic. Thank you!!!
Fantastic. I thought I was going to have to derive this by myself as I only seen superficial descriptions on other videos. A full and complete derivation with example. Nice. Very pleased that I found this video.
Yesterday only I saw ur DDA line drawing algorithm video for the first time.. Ur way of explanation helps me to understand the concept well.. Thank you sir.. Pls make more videos based on circle and ellipse generating algorithms, 2D geometric transformations, matrix representations, 2D viewing in graphics..
yes
Bro do you find any good youtube channel for computer graphics please tell bro I have sem exams
Best explanation of Bresenham's algorithm I have ever heard.
you are the only one who explaind derivation of breshanham algorithm on youtube even my university teacher didnt explained it
The best teacher i have ever seen,the way you explain is awsome.
Nothing clear explanation like this ever seen, good job sir
One of the best explanations and instructors in the web. He has additional C++ courses and algorithms in C++ courses which are one of the best in the net.
sir you are really great
especially your way of explanation i haven't seen anyone like you on youtube
MORE CONTENT ON COMPUTER GRAPHICS NEEDED!!! EITHER AS UDEMY COURSE OR RUclips VIDEO.
Dear sir I have cleared my exams after taking lectures from ur videos Thank you so much sir...😀
Of course sir 😇
I love you sir Got good marks in DAA all thanks to your videos
sir, no one can teach like u. thanks God.. to give us teacher like u......
This man is owsome Singham....full of knowledge...
Best explanation ever for bresenham’s algorithm.
The views are more than the likes, why is this so?? Can't we just like for his efforts?
I found it useful sir.Thank you for your efforts!! ❤
Sir I understood the DDA algorithm. Thanks a lot. And wishing you a happy Teachers Day.
Thank you, sir. I now understand the DDA algorithm. Your explanation will help me get an A in computer graphics.
amazing tutor and amazing teacher Ihave ever seen thanks sir from Ethiopia
Thing is i am really enjoy your lecture so please teach everything you learn in your entire life
28:51 I have a doubt , instead of " if (Pnext - Pk
I literally scrolled down to see this!!
You're correct. He should have given this clarification. Otherwise it's very confusing. Also at 29:41 it should be Pk >= 0 instead of P next - Pk >= 0.
Imo we will check pk for first operation but after that We will pk+1-pk
@@praveensharma4014 I took like 1 hour to get around how Pnext - Pk < 0. I think he was trying to say, Pnext - (pk if less - 0) and Pnext - (pk if greater or equal to 0).
give medal to this great man................................................................
You're a lifesaver sir. The clear cut xplanation ever. Thank u much sir
Sir very clear and detail explanation. Thankyou for explaining algorithm in such an easy way.
Hey, i am studying Virtual Reality and you helped me with graphics do much.. thanks ❤
i have't seen ever like you ,you have agreat teaching skill
from 24:18 there appears to be a redundant explanation about constant which confused me.
P[k] needn't change at all.
and if condition of 29:46 should be just whether P[k] is negative or positive to be clear.
overall, thank you for your video.
*Thank you so much...now i clearly understood about Bresenham's Algo.* 👍😍
Sir you are outstanding!!!
You made it crystal clear...thank you so much for putting your efforts.😊
May god bless this teacher! So much valuable content for free! Thanks! Thanks!
Excellent
Your teaching is simply perfect.
Thankyou sir for explaining in such a simple way..
this is just awesome, finally, i understood an algorithm, and if I understood then anybody can. thank you so much.
Blessed are those who are your students. Why my university teachers are not like you?
Lecture was great Sir.
Thank you for making our B.Tech. Easy.
The best explanation I've found
Sir, I am interested in computer graphics. I love your lecture very much. Your lecture is very comprehensive and easy for me to understand. Please keep on making similar video, thanks!!!
One of the best Teachers.
Sir thank you for straightforward explanation with good english speaking. i subbed to your channel
Completly understood the algorithm, thank you very much sir ❤
sir u r the best on algorithms
you're saving my semester
Us bro us
This was very helpful and easy to understand video...thankyou sir❤. Can you plz make a playlist on computer graphics and multimedia subject. I literally understood the algorithm in one go..🙌🙌
THANK YOU!!! Been struggling for so long, this made is clear and understandable
Thank you very much sir, I can now pass my computer class sir. Thanks sir.
Very good job sir. It's very easy to learn while ur teaching. Thank you sir.
yey dekhne ke baad muje trigonometry easy lagne lgi hai
Dear sir do compiler design tutorials and the way you explain is awesome
Kudos to you sir!! one doubt the algorith you wrote is only when m < 1 for m > 1 we have to do the same just y and x reversed. ?
My professor abdul bari thank you so much for your hard work
Best teacher ever , forever grateful ❤
Thank you Abdul Bari! Your lessons are very useful.
Very helpful. I had to create a vision check system on a 2D grid on a game I was working on, based on this algorithm. First I tried with wikipedia, and found out that the pseudocode there is incorrect. This video helped me to understand how the algorithm works. Once I found out is was trivial to tweak it for all 4 octants. Thank you very much.
your lecture is very exclusive i have never seen such lecture.
Sir, your explanation is so clear that you could consider opening a specific course on computer graphics or digital image processing. ❤
Thank you sir it is very useful😳😇and it's very helpful for my exams thank u so much sir
Sir pls make some vedios on midpoint circle drawing algorithm and midpoint ellipse drawing algorithm am really waiting for ur lecture in a short period of time
Excellent Exlplanation on entire YT
Sir you are a god sent for us, thank you sir 😭😭
at 31:19 he said if pk < 1 we follow first one, but see as we know if pnext-pk < 0 we follow this, how pk be less than zero now...?
have you understood this?
@@sagaralwani75 same issue it should be Pk>0 for 1st one
At 31:14 why are we saying if Pk=0 for the lower equation, when it actually depends on the difference of Pk+1 and Pk?
Thank you sir....for great explanation....plz make videos on other graphical theorem's like polygon filling and boundry fill algorithm.....plz sir...my exams are starting from 30 March.....plz help me sir....
Great..great...great....simple and amazing explaination....i did not get bored even 1 sec.....superbbb.
You are a very good teacher sir❤
Sir pls add bresehams circle drawing algorithm 👍your videos are so helpful to us to easily clear the concepts🙏
algo is complex but this video made it simple
Thank you soo much.U made the concept crystal clear..TYSM❤️❤️
9:20 what a perfection man !!!!!
Thanks you sir your video is so easy to understand
Again, I'm learning a computer science subject from an Indian guy. Thank you
SEMA sir... Your explanation is very much clear
Nice explanation... examples are explained very easily and carefully...
This video is so great and easy to understand. Thank you!
28:29 Why Pk+1 - Pk < 0 means we stayed on the y value.Why it means that we were not incrementing? I cannot catch that. Why didn't u write that if Pk < 0 then we do something and if Pk > 0 then we do something. What is about this Pk+1 - Pk < 0?
sir you are really great .........your teaching influence every students........I was totally satisfied with your lectures......i hope you will make more videos in computer graphics too
Sir you are super explaining unbelievable.
For anyone trying to figure out how to implement m > 1, here is a c++ implementation i created from the pseudo code on the wiki
Just replace all the classes that's not found(like vector and color, these are classes i created)
void DrawPane::renderLine(Vector2f a, Vector2f b, int color) {
if(abs(b.getY() - a.getY()) < abs(b.getX() - a.getX())){
if(a.getX() > b.getX()){
renderLineLow(b, a, color);
}else{
renderLineLow(a, b, color);
}
}else{
if(a.getY() > b.getY()){
renderLineHigh(b, a, color);
}else{
renderLineHigh(a, b, color);
}
}
}
void DrawPane::clearCanvas() {
std::fill_n(m_canvas_data, m_width * m_height, 0);
}
void DrawPane::renderPolygon(Vector2f f, Vector2f f1, Vector2f f2) {
renderLine(f, f1, Color::RED);
renderLine(f1, f2, Color::GREEN);
renderLine(f2, f, Color::BLUE);
}
void DrawPane::renderLineLow(Vector2f a, Vector2f b, int color) {
float dx = b.getX() - a.getX();
float dy = b.getY() - a.getY();
float p = 2*dy -dx;
float i = 1;
if(dy < 0){
dy = -dy;
i = -1;
}
int y = a.getY();
for (int x = a.getX(); x < b.getX(); x++) {
m_canvas_data[y * m_width + x] = color;
if (p > 0){//Set bottom pixel
p -= 2*dx;
y += i;
}
p = p + 2*dy;
}
}
void DrawPane::renderLineHigh(Vector2f a, Vector2f b, int color) {
float dx = b.getX() - a.getX();
float dy = b.getY() - a.getY();
float p = 2*dx -dy;
float i = 1;
if(dx < 0){
dx = -dx;
i = -1;
}
int x = a.getX();
for (int y = a.getY(); y < b.getY(); y++) {
m_canvas_data[y * m_width + x] = color;
if (p > 0) {//Set bottom pixel
p -= 2*dy;
x += i;
}
p += 2*dx;
}
}
God has manifested to me in your form. Thank you.
@EXTREME FUN Aw.. Thank you.
d1-d2 = 2m-1
Which is a constant value
How can we draw a line if it is negative
Example is good it help me alot to understand this..
Thank you very much Sir,
Please make videos about Computability, decidable and undecidable problems.
@@abdul_bari Thank you Sir for replying me.
Sir I have searched and look at some videos too, but I didn't understand it correctly. Because they are not explain it in deatils.
And I have exam in one Week.
Thank you
At 28:30
It should've been Pk which you should be checking for less than 0 or not right anyone?
It will be great if u make more contents for Computer Graphics, as your explainations are deep and very easy
sir at 36:06 isn't it p=2dy-dx. You have written p=2dx-dy. Great vedio sir keep it up.
explanation outstanding sir .you make my day sir .stay blessed .
best explanation out here
now I understand the c.g. , thanks sir for your valuable videos, please update more acc top MCA 3 sem syllabus. And also how to make a notes.
Best explanation on youtube💓
at 31:19 he said if pk < 1 we follow first one, but see as we know if pnext-pk < 0 we follow this, how pk be less than zero now...?
have you understood this?
@@sagaralwani75 here he used it as a general term...by Pk he meant the value of Pk (decision parameter)
But, how he decides pk
@@sagaralwani75 at 31:19 when he said pk
Waha nahi bata rakha h, ek baar wapis dekhiye aap
Best teacher ever.
Sir your class is superb . Kindly take circle and ellipse generation algorithms.