I hereby claim:
- I am core1024 on github.
- I am core1024 (https://keybase.io/core1024) on keybase.
- I have a public key ASBeRw22ha6SMhYMMYH196kr2WDZU9rzwbqWMddy5Rm4Pgo
To claim this, I am signing this object:
# The sway way | |
#output VGA-2 pos 0 0 res 1920 1080 | |
#output DVI-D-1 pos 1920 0 res 1920 1080 | |
#input * { | |
# xkb_layout us,bg | |
# xkb_variant ,phonetic | |
# xkb_options grp:win_space_toggle,grp_led:scroll,ctrl:nocaps | |
#} | |
#exec --no-startup-id xautolock -detectsleep -time 5 -locker 'swaylock -efc 000000' |
Some possible implementations of the Bresenham Algorithms in C. | |
The Bresenham line algorithm is an algorithm which determines which points in an | |
n-dimensional raster should be plotted in order to form a close approximation | |
to a straight line between two given points. | |
It is commonly used to draw lines on a computer screen, as it uses only integer | |
addition, subtraction and bit shifting, all of which are very cheap operations | |
in standard computer architectures. | |
It is one of the earliest algorithms developed in the field of computer graphics. | |
A minor extension to the original algorithm also deals with drawing circles. |
I hereby claim:
To claim this, I am signing this object: