times. Basically I was flattening the path and clearing the flat path only at evaluation. Given the model that is most efficient I couldn't easily convert to a flat path algorithm, however keeping a flat path along for the ride proved very easy, and the memory expenditure to do so is minimal. If I can avoid rebuilding the flat path I think I can shave off enough time to get the algorithm to run in under a minute. We shall see.