Rasterization Using Bresenham Algorithm and Scanline Algorithm
The article discusses the implementation of rasterization techniques using the Bresenham Algorithm and the Scanline Algorithm in Python. It highlights the efficiency of these algorithms for drawing lines and filling polygons. The author shares insights gained from the project, including the internal workings of rendering and polygon filling in graphics systems.
- ▪Bresenham algorithm is the fastest for drawing straight lines on a pixel grid using integers.
- ▪The Scanline Algorithm is used to fill the interiors of polygons by drawing horizontal scanlines.
- ▪The author implemented these algorithms in Python using Pygame to manually draw geometric shapes.
Opening excerpt (first ~120 words) tap to expand
try { if(localStorage) { let currentUser = localStorage.getItem('current_user'); if (currentUser) { currentUser = JSON.parse(currentUser); if (currentUser.id === 3908903) { document.getElementById('article-show-container').classList.add('current-user-is-article-author'); } } } } catch (e) { console.error(e); } yubin yang Posted on May 18 Rasterization Using Bresenham Algorithm and Scanline Algorithm #python #graphics 1. Overview Bresenham algorithm is the fastest algorithm for drawing straight lines on a pixel grid (using only integers). Scanline Algorithm is commonly used to fill the interior of polygons by drawing horizontal scanlines between edges.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at DEV.to (Top).
Discussion
0 commentsMore from DEV.to (Top)
