Anonymous user
Bitmap/Bresenham's line algorithm: Difference between revisions
m
correct potential edge case failure
m (minor tweaks to make more usable elsewhere on rc) |
m (correct potential edge case failure) |
||
Line 2,342:
while(true) do
self:set(x1, y1, c or 0xFFFFFFFF)
if (x1==x2 and y1==y2) then break end
if (err
end▼
if (er2 > -dx) then▼
err, x1 = err-dy, x1+sx
self:set(x1, y1, c or 0xFFFFFFFF)
break
▲ end
end
if (
err, y1 = err+dx, y1+sy
end
| |||