/*
*Copyright (c) 2014,烟台大学计算机学院
*All rights reserved.
*文件名称:Annpion.cpp
*作者:王耀鹏
*完成日期:2015年5月21日
*版本号:v1.0
*
*问题描述:以Point为基类,派生出一个Circle(圆)类。
*输入描述:无。
*输出描述:点与圆心所成直线与圆的两个交点。
*/
#include <iostream>
#include<cmath>
using namespace std;
class Circle;
class Point
{
protected:
double x,y;
public:
Point (){}
Point(double a,double b):x(a),y(b){}
friend ostream &operator<<(ostream & out,const Point &p);
friend void doublePoint (Point &p,Circle &c,Point &p1,Point &p2);
};
ostream &operator<<(ostream & out,const Point &p)
{
cout<<"("<<p.x<<","<<p.y<<")";
return out;
}
class Circle:public Point
{
private:
double r;
public:
Circle(double a,double b,double c):Point(a,b),r(c){}
friend ostream &operator<<(ostream & out,const Circle &c);
friend void doublePoint (Point &p,Circle &c,Point &p1,Point &p2);
};
ostream &operator<<(ostream & out,const Circle &c)
{
cout<<"圆心为:"<<"("<<c.x<<","<<c.y<<")"<<"半径为:"<<c.r;
return out;
}
void doublePoint (Point &p,Circle &c,Point &p1,Point &p2)
{
p1.x = (c.x + sqrt(c.r*c.r/(1+((c.y-p.y)/(c.x-p.x))*((c.y-p.y)/(c.x-p.x)))));
p2.x = (c.x - sqrt(c.r*c.r/(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);
Point p1(1,1),p2,p3;
doublePoint(p1,c1, p2, p3);
cout<<"点p1: "<<p1<<endl;
cout<<"与圆c1: "<<c1<<endl;
cout<<"的圆心相连,与圆交于两点,分别是:"<<endl;
cout<<"交点1: "<<p2<<endl;
cout<<"交点2: "<<p3<<endl;
return 0;
}
运行结果: