code: static int findCornerSeed(List<Point2D_I32> contour ) {
  		Point2D_I32 a = contour.get(0);
  
  		int best = -1;
  		double bestDistance = -Double.MAX_VALUE;
  
  		for (int i = 1; i < contour.size(); i++) {
  			Point2D_I32 b = contour.get(i);
  
  			double d = distanceSq(a,b);
  			if( d > bestDistance ) {
  				bestDistance = d;
  				best = i;
  			}
  		}
  
  		return best;
  	}
docs: The seed corner is the point farther away from the first point. In a perfect polygon with no noise this should
  be a corner.