Algorithm 2.
1: for all (y, z) in plane P perpendicular to X do |
2: x ← 0 |
3: while x < length of volume in X do |
4: d ← ∞ |
5: for all voxels v adjacent to voxel(x,y,z) do |
6: d ← min(d, dist(v, voxel(x,y,z)) |
7: end for |
8: voxel(x,y,z) ← d |
9: x ← x + 1 |
10: end while |
11: end for |