www.piclist.com/techref/microchip/devices.htm?key=16C

I have personally never seen this version of the Bresenham.

At first look, I notice that your decision voxel determines if it will

set the y or the x value. When in fact, one axis will always make a

step regardless of any condition, except the end of the move opertion.

I would like to see the full algorithm you are using, because I have

been searching the net for days and none of the sites and links show it

this way. I basic algorithm I have been seeing all along is:

for(x=x1;x <= x2;x++)

{

<take an a step>

if((eps << 1) >= DeltaX)

{

<take an b step>

eps -= DeltaX;

}

}

The pseudocode algorithm for this routine is written as:

E <- 0, Y -<Y1

FOR X <-X1 TO X2 DO

STEP X

IF(E + M > -0.5)

E <- (E+M)

ELSE Y <- Y - 1

E <- E + M + 1

ENDIF

END FOR

This appears to look close to your method, but not completely. You see,

these are the algorithms that I keep finding when I search the web for

the Bresenham algorithm.

I like your solution, it is much simpler, but I can find any reference

to it on the web at all.

Regards,

James

{Original Message removed}

See also: www.piclist.com/techref/microchip/devices.htm?key=16C