Skip to main content
. Author manuscript; available in PMC: 2015 May 28.
Published in final edited form as: Proc SPIE Int Soc Opt Eng. 2011 Mar 15;7962:79624G. doi: 10.1117/12.874245

Figure 2.

Figure 2

Example of constructing 3D network graph by adding one tract at a time to the existing graph. There are four possible cases of connecting the two end points (indexed 5 and 6) of the tract to the existing graph with nodes {1,2,3,4}. Depending on the proximity of {5, 6}to nodes {1, 2,3,4}, we either do nothing, or add connect one node (either 5 or 6) or add two nodes (both 5 and 6) to the graph.