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. This module
has been extended to include cureves crcles ellipses and thick licnes,
variable thickness lines.
Il n'y a pas de paquet officiel disponible pour openSUSE Leap 15.4