### paint-shop-pro >> Creating a spiral

Can anyone tell me the best way to create a line drawing of a spiral?

Thanks,
Jeff

### paint-shop-pro >> Creating a spiral

I have a spiral binding shape if that is what you want or you could take it
apart and modify

### paint-shop-pro >> Creating a spiral

< http://www.econym.demon.co.uk/psp8scripts/> ;

--
Mike Williams
Gentleman of Leisure

### paint-shop-pro >> Creating a spiral

On Wed, 25 Aug 2004 08:48:12 +0100, Mike Williams

Your fractal pictures are lovely especially The Arkenstone.

Patricia

```Hi all of you,

I am looking for a way to create a spiral using 3d Studio Max 8.

I don't want to create a stair! I need a metal spiral like one of these old
fashioned springs from a watch/clock

The spiral must be flat and preferably I would like to be able to adjust:
- the number of revolutions
- its thickness (the thickness of the metal)
- its height

Does anyone know how to do this?

Thanks, Eibert.

```

```On Sat, 18 Jun 2005 21:57:18 -0700, Anton Sherwood < XXXX@XXXXX.COM >
wrote:
>[snip]

While you're here, I'd like to ask an unrelated question concerning
your page about distributing points on a sphere. Nowhere could I find
any real detail about the "golden section" method you like. We have a
FAQ entry for this problem, and it would help if you could confirm my

Saff and Kuijlaars construct a spiral like so:

| s := 3.6/sqrt(N)
| phi := 0
| pt[0] := (0, 0, -1)
| for k := 1 .. N-2
|   z := -1 + 2*k/(N-1)
|   r := sqrt(1-z*z)
|   phi := phi + s/r
|   pt[k] := (cos(phi)*r, sin(phi)*r, z)
| pt[N-1] := (0, 0, 1)

And if I understand correctly, you prefer something like this:

| tau := (sqrt(5)-1)/2
| inc := 2*pi*tau
| for k := 0 .. N-1
|   z := -1 + 2*k/(N-1)
|   r := sqrt(1-z*z)
|   ang := k*inc
|   pt[k] := (cos(phi)*r, sin(phi)*r, z)

Is this the idea? Any other comments? Do Saff and Kuijlaars approve?

```

```Not sure if this is the right place to post but.. I am looking for an
algorithm to perfom less than comparison of two points on a grid where
an increasing coordinate sequence forms a spiral type path. ie:

The first few points in the sequence form the path:
9 ..>
8 1 2
7 0 3
6 5 4

which would correspond to coordinates (0,0) (0,1) (1,1) (1,0) (1,-1)
....

So pt 0 < pt1 < pt 2 < pt 3 < pt 4 < pt 5 ... etc

The aim is to define a c++ less than operator to use as the comparison
object for a map where the key is 2d points, so that the map values
will be ordered in the spiral sequence.

as opposed to the standard pair comparison of :

x.first  <  y.first  ||  ( !(y.first  <  x.first)  &&  x.second  <
y.second )

Hope someone can provide or direct to some suggestions

Thanks.

```