Simple Pixellated Line-Drawing Algorithm

Bresenham is one of the canonical line drawing algorithms for pixellated grids. Given a start and an end-point, Bresenham calculates which points on the grid need to be filled to generate the line between them. Googling for 'Bresenham', and 'line drawing algorithms' gives some good overview. The code here takes its starting point from Mark Feldman's Pascal code in his article _Bresenham's Line and Circle Algorithms_ at <a href=""></a> .

Non hai ningún paquete oficial dispoñíbel para openSUSE Leap 15.3


openSUSE Tumbleweed