3 ms·
The thing is that modern computer architecture strikes again - like the old linked list vs array thing. Doing a candidate loop over a bounding box with edge eq
by cv5005 2y ago
The thing is that modern computer architecture strikes again - like the old linked list vs array thing.
Doing a candidate loop over a bounding box with edge equations can be much faster than ye old scanline algorithm because it lends itself more easily to simd and parallel approches - you can divide things up into tiles and process multiple pixels at a time with wide instructions and schedule tiles on multiple threads.
- smokel 2y agoFor those not in the know, things only get faster with this approach when you apply some optimization. The article that we are discussing won't get there until part 12. For the time being one may consult Ryg's amazing blog series: https://fgiesen.wordpress.com/2013/02/10/optimizing-the-basic-rasterizer/ https://fgiesen.wordpress.com/2013/02/10/optimizing-the-basi...