1. Map any arbitrary shape to a rectangular array of blocks
2. Identify void block
3. Identify edges to be merged
4. Decide no. of elements in each block
1. Map any arbitrary shape to a rectangular array of blocks
2. Identify void block
3. Identify edges to be merged
4. Decide no. of elements in each block
5. Numbering all nodes 1-N
1. Map any arbitrary shape to a rectangular array of blocks
2. Identify void block
3. Identify edges to be merged
4. Decide no. of elements in each block
5. Numbering all nodes 1-N
6. initialize label of all nodes as -1
1. Map any arbitrary shape to a rectangular array of blocks
2. Identify void block
3. Identify edges to be merged
4. Decide no. of elements in each block
5. Numbering all nodes 1-N
6. initialize label of all nodes as -1
7. For nodes in void blocks, Put label = 0
1. Map any arbitrary shape to a rectangular array of blocks 2. Identify void block 3. Identify edges to be merged 4. Decide no. of elements in each block 5. Numbering all nodes 1-N
6. initialize label of all nodes as -1
7. For nodes in void blocks, Put label = 0
8. For points to be merged, label of higher numbered node = point no. of lower numbered node
1. Map any arbitrary shape to a rectangular array of blocks 2. Identify void block 3. Identify edges to be merged 4. Decide no. of elements in each block 5. Numbering all nodes 1-N 6. initialize label of all nodes as -1 7. For nodes in void blocks, Put label = 0 8. For points to be merged, label of higher numbered node = point no. of lower numbered node
9. Start assigning node numbers
10. (if label-of-point<0) node-no=NN, NN=NN+1
1. Map any arbitrary shape to a rectangular array of blocks 2. Identify void block 3. Identify edges to be merged 4. Decide no. of elements in each block 5. Numbering all nodes 1-N 6. initialize label of all nodes as -1 7. For nodes in void blocks, Put label = 0 8. For points to be merged, label of higher numbered node = point no. of lower numbered node 9. Start assigning node numbers
10. (if label-of-point<0) node-no=NN, NN=NN+1
11. (if label-of-point>0) node-no=node no of point no is labeled
1. Map any arbitrary shape to a rectangular array of blocks 2. Identify void block 3. Identify edges to be merged 4. Decide no. of elements in each block 5. Numbering all nodes 1-N 6. initialize label of all nodes as -1 7. For nodes in void blocks, Put label = 0 8. For merge.., label of higher no. node = point no. of lower no. node 9. Start assigning node numbers 10. (if label-of-point<0) node-no=NN, NN=NN+1
11. (if label-of-point>0) node-no=node no of point no is labeled 12. N(Point)=N(L(Point))
Speech by His Excellency The Governor of Vihiga County (Rev) Moses Akaranga During The Closing Ceremony of The Induction Course For The Sub-County and Ward Administrators.