At the moment, I'm implementing an algorithm which defines a spiral using the method outlined in the following paper:
One of the challenges I've yet to sort out is how to calculate a point on the spiral given a point that is offset from it. Essentially, it's calculating the orthogonal vector from a point near the spiral and the corresponding distance. This appears to require an iterative process to zero in on the location with a desired level of precision, as suggested here:
Distance between point and a spiral
I haven't taken the time to sort out how to adapt that for my case just yet, as I was hoping I could get some direction on whether or not this is the sort of approach I need to implement - or is there something more efficient / direct?