3 ms·
As an aside, I always think it's such a shame that no one seems to mention Bresenham's updated, and quicker, run-length slice line algorithm. http://www.phatco
by sclangdon 9y ago
As an aside, I always think it's such a shame that no one seems to mention Bresenham's updated, and quicker, run-length slice line algorithm.
http://www.phatcode.net/res/224/files/html/ch36/36-01.html http://www.phatcode.net/res/224/files/html/ch36/36-01.html
- vanderZwan 9y agoI'm pretty sure I've seen it implemented in a number of TI-83 z80 ASM programs back in the early 2000s, but I can't find a link to anything now. I recall seing a "bresenSlice" implementation in Z80 at some point though. EDIT: Was it ever patented? Might be why people didn't use it. EDIT2: I googled it, couldn't find any patents (except for other patents mentioning Bresenham's algorithm). However, the Run-Slice algorithm was published in 85, so it hasn't had as much time to become famous. Also, I found this article describing a newer algorithm from 1999 which looks pretty interesting too: > Nowadays, most of research papers suggest improvements of the DDA method that was first presented by J. Bresenham. This paper proposes a new algorithm based on a careful analysis of the line segments’ properties some of them previously unused. http://www.ai.univ-paris8.fr/~boyer/Articles/1999_cgf.pdf http://www.ai.univ-paris8.fr/~boyer/Articles/1999_cgf.pdf