code: def find_farthest(point, hull):
      '''Find the vertex in hull farthest away from a point'''
      d_start = np.sum((point-hull[0,:])**2)
      d_end = np.sum((point-hull[-1,:])**2)
      if d_start > d_end:
          # Go in the forward direction
          i = 1
          inc = 1
          term = hull.shape[0]
          d2_max = d_start
      else:
          # Go in the reverse direction
          i = hull.shape[0]-2
          inc = -1
          term = -1
          d2_max = d_end
      while i != term:
          d2 = np.sum((point - hull[i,:])**2)
          if d2 < d2_max:
              break
          i += inc
          d2_max = d2
      return i-inf find_farthest(point, hull):
      '''Find the vertex in hull farthest away from a point'''
      d_start = np.sum((point-hull[0,:])**2)
      d_end = np.sum((point-hull[-1,:])**2)
      if d_start > d_end:
          # Go in the forward direction
          i = 1
          inc = 1
          term = hull.shape[0]
          d2_max = d_start
      else:
          # Go in the reverse direction
          i = hull.shape[0]-2
          inc = -1
          term = -1
          d2_max = d_end
      while i != term:
          d2 = np.sum((point - hull[i,:])**2)
          if d2 < d2_max:
              break
          i += inc
          d2_max = d2
      return i-inc
docs: Find the vertex in hull farthest away from a point