Difference between revisions of "Bresenham's Line Algorithm"
(Adds a code example for golang)
|Line 504:||Line 504:|
Revision as of 20:08, 8 August 2014
Bresenham's Line Algorithm is a way of drawing a line segment onto a square grid. It is especially useful for roguelikes due to their cellular nature.
In libtcod it is accessible using
line(x1, y1, x2, y2, callback). Below are several hand-coded implementations in various languages.
Here is a simple way of using the algorithm in C# with delegates.
Here's a C++ version; plot() draws a "dot" at (x, y):
A template metaprogram implementation (requires the Boost.MPL library):
Here's a Lua port:
This Python version returns a list of (x, y) tuples. It was converted from the Ruby version below, but also reverses the list to begin with the first coordinates.
Here's a Ruby version, it returns an array of points, each being a hash with 2 elements (x and y).
Here is a generic way of using the algorithm in VB.NET using delegates.
A slightly verbose version in Haskell. See the discussion page for a variant one line shorter, but IMHO less readable. I bet other version, more readable and more succinct, can be written.
Here's an ActionScript implementation that creates a Line object with an array of points.
This is a translation for golang from the Python example above, it returns a slice to a struct that contains two ints.