public class HullAlgorithm {

  public static double findLargestDistance(Pointd[] points) {

    double diffX, diffY, dist, largest = 0.0;

    // 1. Compute the convext hull:
    Hull grahamHull = new Hull(points);

    // 2.1 Extract the hull points:
    Pointd [] hull = grahamHull.getHull();

    // 2.2 Extract the hull size:
    int size = grahamHull.getSize();

    // 3. Compute largest distance between hull points:
    for (int i=0; i<size; i++) {
      for (int j=i+1; j<size; j++) {
        diffX = hull[i].x - hull[j].x;
        diffY = hull[i].y - hull[j].y;
        dist = Math.sqrt(diffX*diffX + diffY*diffY);
//        largest = Math.max(largest, dist);
        if (largest<dist)
          largest = dist;
      }
    }
    return largest;
  }
}