Hello I would like to ask what is the underlying method employed for computing geodesic distances in the -surface-geodesic-distance Workbench command. Is it simply a Dijkstra approximation? or something more sophisticated like the exact algorithm of [1]?
I have had a quick look at the code and I found methods like "dijkstra" and "aStar", but I quickly realised that is probably better to ask here :) Thank you very much! [1] MITCHELL, J.S.B.,MOUNT, D.M., AND PAPADIMITRIOU, C. H. 1987. The discrete geodesic problem. SIAM J. of Computing 16(4), 647–668. -- Stefan Pszczolkowski P. Ph.D. Research Fellow Radiological Sciences Division of Clinical Neuroscience Room B115-117, School of Medicine University of Nottingham Queen's Medical Centre, Derby Road Nottingham NG7 2UH Tel: 44 (0) 115 748 4389 Website: https://stefanpsz.github.io/ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law. _______________________________________________ HCP-Users mailing list [email protected] http://lists.humanconnectome.org/mailman/listinfo/hcp-users
