Rasterizer Algorithm Explanation 

Great to see more works being done with Manim. It's a pure pleasure watching all the animations.

This is very well done. I've seen many articles that were too technical to understand and too excessive with all of the details. The visuals helped a lot with understanding the algorithm.

Great explanation. I did something like this in high-school, but had to code this just recently. It’s very close to what I was thinking of doing, but watching your vid helped clarify things in my mind to a point I was able to make further optimizations. It is an excellent starting point, and The animation was exactly what I needed. More of these please.

Wow this guy has a really nice voice! I wish I was that cool!

most simple and understandable explanation. Thank you !!!

Wow, one of the best explanation I've heard, thank you!

Such a great explanation and what a nice voice! Perfect 5/7

Beautiful and simple, thank you for this very helpful and easy explanation.

- Well done. Thx. - Clear, concise, engaging.

Beautifully done. Masterfully explained thanks so much for sharing

Simplest explanation ever, Big like

this made it so clear. thank you so much

Beautiful video ❣️ truly amazing 💯🔥

thank you very much your explanation is almost perfect and the graphics were very helpul unfortunately this is another example of „what can be explained in 8 minutes, what my professor can't explain within around a total of 20 hours“ i‘m glad there are videos like this

THANK YOU!!! Great teaching!

This is so interesting! Thanks for making this video. It helps me approach image binary representation without feeling intimidated we I'm trying to code out an idea.

Excellent!!! Congratulations!!!

Beautiful, thank you and keep it up.

Wow, this makes me want to write my own implementation of this. Very interesting stuff.

Very nice video! Good job.

Best explanation video.

Nice explanation with great animation thx

Thanks you so much. This very easy to understand!!

Amazing video! Reminds me of 3b1b. keep it up!

Very good animation, well done

Great! manim revolutionazed visual explanation videos.

Basically, lerp colors between each vertex on a line, then fill lerped colors between each pixel! I hope I am right and this helped anyone who wanted a quick explanation ":D!

Great work

This video was awesome

nice video dude!

Great explanation

Shouldn't the first linear equation with given point be y=x+2?

Thanks! This helped me.

Thanks very much, understandable

an awesome video.

Thank you.

awesome!

Such an in depth and clear explanation!

Awesomeeee

Well done.

Just to add to the discussions. Some textbook uses the DDA-based approach and maintain an active edge list which stores all of the edges that crosses the current scanline (I am not able to describe the algorithm in full here bu t just to give you an idea). By exploiting the coherence properties of scanline (such that all pixels bounded by the same 2 edges in a scanline must have the same "insideness"), one can efficiently compute all of the "insideness values" of all pixels along the scanline. I am pretty sure that this approach can easily generalise to support color interpolation across scanline as well. A distinct advantage of what seemingly to be an inefficient and counter-intuitive approach is that it can handle overlapping polygons. By maintaining also a polygon identifier inside the active edge list, we can effectively perform visibility-testing right at the rasterisation stage (without needing z-buffer) and writes directly to frame buffer. I might be wrong here. Please correct me if I am.

Nice! It would be great to see Bresenham algorithm on the circle.

Very nice video, i'm just wondering what is exactly the formula for linear interpolation.. How did you use it in order to interpolate colors between vertices? Thanks

Perfect expo

great!

nice! .

This resembles me 3blue1brown.

ty

Great

Hey, you have outstanding explanation skills (just in case you don't know) ... You should keep uploading new videos, rather start a playlist on some topic 🔥

how did you get manim to render this?

Thanks, I'm building a small graphic motor to be implemented in a ESP32 :)

nice video, but why isnt the triangle after being projected from worldspace to screen space converted to its parametric form there and then for each pixel it is checked if both parameters are within the 0-1range? im no programmer but solving the same equasion for every pixel seems faster than storing so many things in lists and sorting values.

For texturemapped triangles however you need to use perspective divide instead of interpolation

Would bresenham's algorithm work for vertical lines?

y3 = [1,1,2,9] why 1 twice?

Nice backgroundmusic

Shoouldn't the first linear equation with given point be y=x+2?

how to make this animation, PPT?

Thank you for the video. The link to the source code is broken. Can you fix it? I would like to see the code.

Why'd you delete the source code??? Can you reupload it please?

Nice video! How did you make the animation?

Hi, the Github link does not work any more

is this equivalent to using barycentric coordinates?

Hi. Not clear @3:30 onwards why y[3] repeats the 1 and similar for the y[1] repeats the 9

github link can not found ?

All of this is done by dedicated hardware(ROPs) in sub-milliseconds time, modern GPUs are amazing, if you want to know your GPU's raster speed, check its number of ROPs(and memory bandwidth too)..

In 3:28 why in y3 why there is two 1??

this is the new 3blue1brown

I believe the image coordinate is wrong in this. 0, 0 is in the top left corner.

3blue1brown fan?

Okay let's go, I am going to develop the killer of VulkanAPI ! 👹👹😈😈

why is y_3=[1 1 2 9] and not [1 2 9] same with 7899 not being 789 for y_1 and 88 not being just 8 for y_10 (although this can kinda make sense?)

Jurgen Klopp EROTIC VOICE YOU??? 🤔

Pretty video but this algorithm would be extremely slow.

Imagine if gpus used *flood fill* algorithm instead lmao

3b1b?

lol are you using 3blue1brown's rendering library?

Way to few subscribers :(

Wow this is slow lmao

The best thing about this was the graphics. This was otherwise terrible. First off, he doesn't show how to implement Bresenham's algorithm. You don't solve the linear equation. That's the whole point of the algorithm. Second, when you do use it, you only use it for wire-frame graphics. For polygon graphics you only need to generate the pixel pairs for each raster, the start and finish. As you can see, this linear equation doesn't achieve that.

Your first equation is wrong