Hi Mike, I can't remember all the details (and the guy who wrote it is gone), but I remember that it was not all that sophisticated (though it works pretty well). I think it choses the next vertex based which one will get it closer in 3D space (and not retrace it's steps). I think it uses whatever surface you're drawing on.
doug
Michael Harms wrote:
Hello, I was wondering what approach is used to connect marked vertices when using the "Make Path" and "Make Closed Path" tools of tksurfer.
Does the "connecting" operation just use the shortest (geodesic) distance between vertices, as determined by the currently displayed surface?
Does the 'mri_path2label' binary use the same algorithm?
And, is there any mechanism for taking curvature or sulcal depth into account? (e.g., connect points along a line of minimum or maximum curvature change, rather than using geodesic distance)
thanks, Mike H.