Algorithm 2.
1. | procedure BOUNDARIESESTIMATION(G) |
2. | C ← centroid( G ) |
3. | for i ← 1 : size( G ) do |
4. | b ← bisector( G( i ) ) |
5. | p1 ← nearest point( C, G( i ), b, true) |
6. | p2 ← nearest point(C, G( i ), b, false) |
7. | end procedure |
1. | procedure BOUNDARIESESTIMATION(G) |
2. | C ← centroid( G ) |
3. | for i ← 1 : size( G ) do |
4. | b ← bisector( G( i ) ) |
5. | p1 ← nearest point( C, G( i ), b, true) |
6. | p2 ← nearest point(C, G( i ), b, false) |
7. | end procedure |