I am trying to implement the so called pivot algorithm for a markov chain
monte carlo simulation of self avoiding random walks. There must be a
simple method of checking to see if the pivoted portion of the random walk
intersects with the previous section?
In other words I have a list of
If the pivoted portion and the previous section can be viewed as sets
of line segments, there is a function in one of the spatial packages
that tests for intersections between sets of line segments.
crossing.psp() in spatstat if I remember correctly.
-Don
At 10:26 AM -0800 11/19/06,
