Wake up, brain. Something about music and notes.

Okay, I remember now. Not complicated at all, I already have it written down somewhere what the gist of the algorithm is. I just don't know how I'll want to interface it.

Probably command line.

Wow. I actually did the thing I was talking about in my last entry and it actually worked.

Anyway, this next entry is just going to be an out-loud brainstorm about what I think will be a very costly method. I should probably develop this idea with the assumption that I won't be working with very large images, or that this is really more for a computer with far more RAM than I have.

It occurs to me now, that for each degree you want to test, you have to offset the flipped image by two degrees. It's hard to explain exactly why, but think of a mirror rotating around an axis; the reflection in the mirror will be rotating twice as fast. If you turn the mirror 45 degrees, everything in it will appear to turn 90 degrees, and so on. So the "flowtest" bitmap need only be 180 pixels wide, and for each column x you need to grab from 2*x degrees around the original pi

PROCEDURE FOR "FLOW MAPPING"

Assuming you already have a bitmap object to "map the flow" of ...

Establish a radius (how far around each point you want to use), and decide how many inbetween circles you want to test.

int radius = 10;
int subpixels = 3;

Make a new bitmap object:

flowtest = new bitmap(360, radius*subpixels);