Bjorklund’s vs Bressenham's algorithm for Euclidean rhythms

I've been trying to nail down an efficient and correct Euclidean rhythm generator. The original algorithm (Bjorklund's algorithm) involves a lot of list manipulation. But the common replacement (a variation of Bressenham's) appears to be *wrong*. It produces a Euclidean rhythm, but arbitrarily offset and rotated compared to the original for most cases. Nobody seems to note this.

Can anyone tell me how to get Bressenham's to match the output of Bjorklund's?

Furthermore, there appear to be two errors in output for (5,16) in the original paper.