8 Mar
2005
8 Mar
'05
5:48 p.m.
Hi Daniel -
Well it seems to me that you're almost there already. A Dijkstra algorithm is the ideal engine to determine radial paths from a central node - I suspect you just need to tune the graph cost function to take the Euclidean distance between nodes (as opposed to the logical distance) into account.
--R
--
Rudolph Pienaar, M.Eng, D.Eng / email: rudolph@nmr.mgh.harvard.edu
MGH/MIT/HMS Athinoula A. Martinos Center for Biomedical Imaging
149 (2301) 13th Street, Charlestown, MA 02129 USA