First, just to give a visual idea of what I'm after, here's the closest result (yet not exactly what I'm after) image that I've found:
Here's the entire site-reference: http://www.mathematische-basteleien.de/spiral.htm
BUT, it doesn't exactly solve the problem I'm after. I would like to store an array of points of a very specific spiral algorithm.
- The points are evenly distributed
- The 360 degree cycles have an even gap
If I'm not mistaken, the first two points would be:
- point[ 0 ] = new Point(0,0);
- point[ 1 ] = new Point(1,0);
But where to go from here?
The only arguments I'd like to provide are:
- the quantity of points I wish to resolve (length of array).
- the distance between each points (pixels gap).
- the distance between cycles.
It almost sounds, to me, that I have to calculate the "spiral-circumference" (if there's such a term) in order to plot the evenly distributed points along the spiral.
Can 2*PI*radius be reliably used for this calculation you think?
If it's been done before, please show some code example!