Bresenham's algorithm implementation
Go to file
Evan Burkey 3ff5aa4397 add github link to mod 2022-05-17 09:49:31 -07:00
.gitignore init 2022-05-17 09:20:48 -07:00
LICENSE init 2022-05-17 09:20:48 -07:00
README.md init 2022-05-17 09:20:48 -07:00
bresenham.go init 2022-05-17 09:20:48 -07:00
bresenham_test.go init 2022-05-17 09:20:48 -07:00
go.mod add github link to mod 2022-05-17 09:49:31 -07:00
go.sum init 2022-05-17 09:20:48 -07:00

README.md

Bresenham

A quick generic implementation of Bresenham's Line Algorithm.

Usage

Arguments are constrained to signed types. The line is returned as a slice of type Point[T], a type provided by the library.