/*
*copyright (c)2015,烟台大学计算机学院
*All rights reserved
*文件名称:project.cpp
*作者:孙春红
*完成日期:2015年5月27日
*版本号:v1.0
*
*问题描述:(6)与圆心相连的直线:给定一点p,其与圆心相连成的直线,
会和圆有两个交点,如图。在上面定义的Point(点)类和Circle(圆)类基础上,
设计一种方案,输出这两点的坐标。
*输入描述:略。
*程序输出:略。
*/
#include <iostream>
#include <cmath>
using namespace std;
class Circle;
class Point
{
protected:
double x;
double y;
public:
Point (double a=0,double b=0):x(a),y(b) {}
friend ostream& operator<<(ostream &out,Point &p);
friend void points(Circle &c,Point &p,Point &p1,Point &p2);
};
class Circle:public Point
{
private:
double radius;
public:
Circle(double a,double b,double r):Point(a,b),radius(r) {}
friend ostream& operator<<(ostream &out,Circle &c);
friend void points(Circle &c,Point &p,Point &p1,Point &p2);
};
ostream& operator<<(ostream &out,Circle &c)
{
cout<<"圆心是:("<<c.x<<","<<c.y<<") 半径是: r="<<c.radius<<endl;
return out;
}
ostream& operator<<(ostream &out,Point &p)
{
cout<<"("<<p.x<<","<<p.y<<")"<<endl;
return out;
}
void points(Circle &c,Point &p,Point &p1,Point &p2)
{
p1.x = (c.x + sqrt(c.radius*c.radius/(1+((c.y-p.y)/(c.x-p.x))*((c.y-p.y)/(c.x-p.x)))));
p2.x = (c.x - sqrt(c.radius*c.radius/(1+((c.y-p.y)/(c.x-p.x))*((c.y-p.y)/(c.x-p.x)))));
p1.y = (p.y + (p1.x -p.x)*(c.y-p.y)/(c.x-p.x));
p2.y = (p.y + (p2.x -p.x)*(c.y-p.y)/(c.x-p.x));
}
int main( )
{
Circle c1(3,2,4),c2(4,5,5);
Point p1(1,1);
Point p2,p3;
cout<<"圆c1: "<<c1;
cout<<"点p1: "<<p1;
points(c1,p1,p2,p3);
cout<<"点p1 和圆c1的圆心相连的直线与圆的交点是:"<<endl;
cout<<"交点1:"<<p2;
cout<<"交点2:"<<p3;
return 0;
}
运行结果:
知识点总结:
运用数学运算以及输出的运算符重载完成对圆和点关系的运算