double
calculate_distance(point_xy* query, rtr_mbr_t* targetmbr) /*Starting with just a mbr and a fixed point to make the calculations*/
//calculate_distance(const Geometry *query, const MBR *target)
{
  double mindist= 0;

  //Distance inside a mbr
  if ((query->x > targetmbr->xmin) && (query->x < targetmbr->xmax) && (query->y > targetmbr->ymin) && (query->y < targetmbr->ymax))
  {
    return 0;
  }
  // Distance to a point
  if (targetmbr->xmax == targetmbr->xmin && targetmbr->ymin ==targetmbr->ymax)
  {
     mindist =  sqrt((pow((targetmbr->xmax -query->x), 2))+(pow((targetmbr->ymax - query->y), 2))); //xy-max

  }

  else
  {
    double qp1p2= linesegment_distance(query, targetmbr->xmin, targetmbr->xmax, targetmbr->ymin, targetmbr->ymin);

    double qp2p3= linesegment_distance(query, targetmbr->xmax, targetmbr->xmax, targetmbr->ymin, targetmbr->ymax);

    double qp3p4= linesegment_distance(query, targetmbr->xmax, targetmbr->xmin, targetmbr->ymax, targetmbr->ymax);

    double qp4p1= linesegment_distance(query, targetmbr->xmin, targetmbr->xmin, targetmbr->ymax, targetmbr->ymin);

    double minlinedist= (qp1p2 < qp2p3)? qp1p2 : qp2p3;
    double minlinedist1= (qp3p4 < qp4p1)? qp3p4 : qp4p1;
    double mindist = (minlinedist < minlinedist1)? minlinedist : minlinedist1;

    //Compare and return the smallest distance
    // mindist = (dist1 < dist0)? dist1 : dist0;
  }


  return mindist;
}