Figure - PMC

Skip to main content

View full-text article in PMC

. Author manuscript; available in PMC: 2013 Oct 29.

Published in final edited form as: Proc IEEE Int Symp Biomed Imaging. 2011:10.1109/ISBI.2011.5872528. doi: 10.1109/ISBI.2011.5872528

Fig. 2 — Schematic illustration of the ε-neighbor updating scheme. (a) Initially the graph consists of one edge e₁₁e₁₂ (black). At the next stage, we determine how to connect the new edge e₂₁e₂₂ (red) to the existing graph . The node e₂₁ is within the ε radius (blue) of the node e₁₂. So e₂₁ is the ε-neighbor of and has to be merged with e₁₂. (b) The coordinates of the merged node e₁₂ is updated to e₁₂′ (green) and the new edge e₁₂′e₂₂ is included in .

Inline graphic — Schematic illustration of the ε-neighbor updating scheme. (a) Initially the graph consists of one edge e₁₁e₁₂ (black). At the next stage, we determine how to connect the new edge e₂₁e₂₂ (red) to the existing graph . The node e₂₁ is within the ε radius (blue) of the node e₁₂. So e₂₁ is the ε-neighbor of and has to be merged with e₁₂. (b) The coordinates of the merged node e₁₂ is updated to e₁₂′ (green) and the new edge e₁₂′e₂₂ is included in .