Explaination of Algorithm
  • The first double for-loop computes new values of the (i, j)th entry of i, by scanning the 3 X 3 neighborhood of (i, j).
  • The variable s contains the sum of these values (with the value of L(i, j) subtracted away)
  • The statement 1.1.4 applies the life and death rules described earlier.
  • The auxiliary array X holds the new value of L(i, j). The value cannot be replaced in the L array until more computations of L values are made.
  • In step 2.1.1 the new L values are stored in X, replace the old ones, and the new values are displayed.
Previous Slide
Next Slide




1