Rasterizer Algorithm Explanation

Our apprentice Cédric Girardin made a great video about the rasterizing algorithm with the MANIM animation library.

Music Resonance by Vincent Rubinetti:

Source Code:

Manim:

[pyxelr]

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

[lambichlambrovski]

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.

[anthonypace]

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.

[swamihuman]

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

[schmarcel]

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

[__Bomberman__]

I was so dumb until I watched this. Long time ago I wanted to make a scanline renderer and used some weird complex math to get the texture coordinates, now this is much easier. I'd like to know about perspective correctness for 3D triangles.

[prathmeshrautkar]

most simple and understandable explanation. Thank you !!!

[CarmeloGiliberto]

great and simple explanation of the Rasterisation algorithm. For the sake of completion, it would be nice to have the same type of video on Ray Tracing algorithm which complement the Rasterisation one.

[LogicEu]

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

[lancemarchetti]

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.

[ricky]

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

[luckylukeskywalker]

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

[НиколайКучерявенко-зш]

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

[aevideos]

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

[DmitriyKakaulin]

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

[SirusStarTV]

Great! manim revolutionazed visual explanation videos.

[mingsumsze]

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.

[Brahvim]

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!

[karen-]

Beautifully done. Masterfully explained thanks so much for sharing

[Negh_]

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