#explorable-explanations of #line-drawing from Amit Patel, saying, “I sometimes see people adapting the #Bresenham line drawing algorithm to draw lines on a grid (especially for roguelike games), but I prefer a much simpler algorithms that runs just as fast. I’ll show the algorithms I use.”
on 02025-10-26#Bresenham #graphics #algorithms modified to draw thick lines
on 02024-02-21#PDF scan of Phil Koopman’s article (01986? #FORTH Dimensions Volume VIII, No. 6) giving #Bresenham’s line-drawing algorithm in Forth. 23 lines of code provide a driver for 4-color CGA with comments explaining how to patch it for EGA or 2-color CGA. He got the algorithm from p. 435 of “Foley and Van Dam, Fundamentals of ICAD”, maybe actually “Fundamentals of Interactive Computer Graphics”, where p. 435 gives an implementation in Pascal. 2D #graphics #retrocomputing
on 02024-01-28#PDF #paper from #Bresenham in 01965 giving Bresenham’s line-drawing algorithm: “Algorithm for computer control of a digital plotter”. Says the original paper was “An incremental algorithm for digital plotting” in 01963. Also incidentally says Iverson “introduced” the floor/ceiling notation, though as they were both IBMers, possibly we should take that “seriously but not literally”. 2-D #graphics #algorithms
on 02024-01-28