Найти расстояние точки до ближайшей стороны треугольника

#include <iostream>
 
struct dot{double x; double y;
        dot(){};
        dot(double _x, double _y)
            : x(_x), y(_y) {} };
 
class MyTriangle {
 
public:
    dot A, B, C;
    
 
    MyTriangle(){};
    MyTriangle(double ax, double ay, double bx, double by, double cx, double cy) : 
    A(ax,ay), B(bx,by), C(cx,cy) 
    {
        SetMiddles();
    };
 
    double MinDistance(dot _myDot)
    {
        double temp_a = GetDistance(_myDot, mid[0]);
        
        for(int i=1; i<3; i++)
        {
            double temp_b = GetDistance(_myDot, mid[i]);
            if(temp_b < temp_a) temp_a = temp_b;
        }
        
        return temp_a;
    }
 
    void PrintResult(dot _myDot)
    {
        std::cout << "Min distance = " << MinDistance(_myDot) << "\n\n";
    }
 
    void SetMiddles()
    {
        mid[0] = FindMiddle(A,B);
        mid[1] = FindMiddle(B,C);
        mid[2] = FindMiddle(C,A);
    }
 
private:
 
    dot mid[3];
 
    dot FindMiddle(dot _a, dot _b)
    {
        dot temp((_a.x-_b.x)/2+_b.x, (_a.y-_b.y)/2+_b.y);
        return(temp);
    }
 
    double GetDistance(dot _myDot, dot _mid)
    {
        return ( sqrt( (_myDot.x - _mid.x)*(_myDot.x - _mid.x) + (_myDot.y - _mid.y)*(_myDot.y - _mid.y)  ));
    }
 
};
 
int main(void)
{
   MyTriangle first_tr(1,10,1,-10,44,1024);
   MyTriangle second_tr(0,0,100,100,0,100);
   MyTriangle third_tr(1,1024,-96.1,1028,17,2048.9);
 
   dot myDot;
   std::cout << "Input dot x, y ";
   std::cin >> myDot.x >> myDot.y;
 
   first_tr.PrintResult(myDot);
   second_tr.PrintResult(myDot);
   third_tr.PrintResult(myDot);
 
   system("pause");
   return (0);
}

// Example program
#include <iostream>
#include <stdlib.h>
#include <math.h>
 
using namespace std;
 
typedef float my_type_data;
typedef unsigned int my_type_count;
 
const my_type_count num_vert=3;
 
my_type_data line_length(my_type_data x1,my_type_data x2,my_type_data y1,my_type_data y2){
my_type_data l1=pow(x2-x1,2);
my_type_data l2=pow(y2-y1,2);
return sqrt(l1+l2);
}
 
class my_point{
public:
my_type_data x;
my_type_data y;
 
my_point():x(0),y(0){}
my_point(my_point& p):x(p.x),y(p.y){}
my_point(my_type_data x1,my_type_data y1):x(x1),y(y1){}
 
};
 
class my_triangle{
public:
my_point point_array[num_vert];
 
my_triangle(){}
my_triangle(my_point& p1,my_point& p2,my_point& p3){
point_array[0]=p1;
point_array[1]=p2;
point_array[2]=p3;
}
 
};
 
void my_fun(my_triangle& t,my_point& p){
 
my_point middle[num_vert];
my_type_data l[num_vert];
my_type_data l_min;
 
middle[0].x=(t.point_array[0].x+t.point_array[1].x)/2;
middle[1].x=(t.point_array[1].x+t.point_array[2].x)/2;
middle[2].x=(t.point_array[0].x+t.point_array[2].x)/2;
 
middle[0].y=(t.point_array[0].y+t.point_array[1].y)/2;
middle[1].y=(t.point_array[1].y+t.point_array[2].y)/2;
middle[2].y=(t.point_array[0].y+t.point_array[2].y)/2;
 
my_type_count i;
for(i=0;i!=num_vert;++i){
 
l[i]=line_length(p.x,middle[i].x,p.y,middle[i].y);
 
if(i==0) l_min=l[i];
if(l[i]<l_min) l_min=l[i];
 
}//for
 
cout<<endl<<endl<<"l1="<<l[0]<<" l2="<<l[1]<<" l3="<<l[2]<<" l_min="<<l_min;
 
return;
}
 
int main(){
    
my_point point0(0,0);
my_point point1(0.5,0);
my_point point2(1,0);
 
my_point p1(0,0);
my_point p2(1,0);
my_point p3(0,1);
my_triangle t1(p1,p2,p3);
 
my_point p10(0,0);
my_point p20(1,0);
my_point p30(0,1);
my_triangle t10(p10,p20,p30);
 
my_point p100(0,0);
my_point p200(1,0);
my_point p300(0,1);
my_triangle t100(p100,p200,p300);
 
my_fun(t1,point0);
my_fun(t10,point1);
my_fun(t100,point2);
    
return 0;
}