// from https://rosettacode.org/wiki/Zhang-Suen_thinning_algorithm#Java

srecord noeq ZhangSuenThinner(IBinaryImage img) {
  static final int[][] nbrs = {{0, -1}, {1, -1}, {1, 0}, {1, 1}, {0, 1},
    {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}};
 
  static final int[][][] nbrGroups = {
    {{0, 2, 4}, {2, 4, 6}},
    {{0, 2, 6}, {0, 4, 6}}};
 
  new PtBuffer toWhite;

  run {
    bool firstStep;
    int w = image.getWidth(), h = image.getHeight();

    while ping (true) {
      firstStep = !firstStep;

      for (int r = 1; r < h - 1; r++)
        for (int c = 1; c < w - 1; c++) {
          if (!image.getBoolPixel(c, r))
            continue;

          int nn = numNeighbors(r, c);
          if (nn < 2 || nn > 6)
            continue;

          if (numTransitions(r, c) != 1)
            continue;

          if (!atLeastOneIsWhite(r, c, firstStep ? 0 : 1))
            continue;

          toWhite.add(c, r);
        }

      if (!firstStep && empty(toWhite)) break;
      for (Pt p : toWhite)
        image.setPixel(p.x, p.y, false);
      toWhite.clear();
    }
  }

  int numNeighbors(int r, int c) {
    int count = 0;
    for (int i = 0; i < nbrs.length - 1; i++)
      if (image.getBoolPixel(c + nbrs[i][0], r + nbrs[i][1]))
        count++;
    ret count;
  }

  int numTransitions(int r, int c) {
    int count = 0;
    for (int i = 0; i < nbrs.length - 1; i++)
      if (!image.getBoolPixel(c + nbrs[i][0], r + nbrs[i][1])
        && image.getBoolPixell(c + nbrs[i+1][0], r + nbrs[i+1][1]]))
          count++;
    ret count;
  }

  bool atLeastOneIsWhite(int r, int c, int step) {
    int count = 0;
    int[][] group = nbrGroups[step];
    for (int i = 0; i < 2; i++)
      for (int j = 0; j < group[i].length; j++) {
        int[] nbr = nbrs[group[i][j]];
        if (!image.getBoolPixel(c + nbr[0], r + nbr[1]) {
          count++;
          break;
        }
      }
    ret count > 1;
  }
}