计算几何 - UVA - 12304
题目链接
Problem E
2D Geometry 110 in 1!
This is a collection of 110 (in binary) 2D geometry problems.
CircumscribedCircle x1 y1 x2 y2 x3 y3
Find out the circumscribed circle of triangle (x1,y1)-(x2,y2)-(x3,y3). These three points are guaranteed to be non-collinear. The circle is formatted as (x,y,r) where (x,y) is the center of circle, r is the radius.
InscribedCircle x1 y1 x2 y2 x3 y3
Find out the inscribed circle of triangle (x1,y1)-(x2,y2)-(x3,y3). These three points are guaranteed to be non-collinear. The circle is formatted as (x,y,r) where (x,y) is the center of circle, r is the radius.
TangentLineThroughPoint xc yc r xp yp
Find out the list of tangent lines of circle centered (xc,yc) with radius r that pass through point (xp,yp). Each tangent line is formatted as a single real number “angle” (in degrees), the angle of the line (0<=angle<180). Note that the answer should be formatted as a list (see below for details).
CircleThroughAPointAndTangentToALineWithRadius xp yp x1 y1 x2 y2 r
Find out the list of circles passing through point (xp, yp) that is tangent to a line (x1,y1)-(x2,y2) with radius r. Each circle is formatted as (x,y), since the radius is already given. Note that the answer should be formatted as a list. If there is no answer, you should print an empty list.
CircleTangentToTwoLinesWithRadius x1 y1 x2 y2 x3 y3 x4 y4 r
Find out the list of circles tangent to two non-parallel lines (x1,y1)-(x2,y2) and (x3,y3)-(x4,y4), having radius r. Each circle is formatted as (x,y), since the radius is already given. Note that the answer should be formatted as a list. If there is no answer, you should print an empty list.
CircleTangentToTwoDisjointCirclesWithRadius x1 y1 r1 x2 y2 r2 r
Find out the list of circles externally tangent to two disjoint circles (x1,y1,r1) and (x2,y2,r2), having radius r. By “externally” we mean it should not enclose the two given circles. Each circle is formatted as (x,y), since the radius is already given. Note that the answer should be formatted as a list. If there is no answer, you should print an empty list.
For each line described above, the two endpoints will not be equal. When formatting a list of real numbers, the numbers should be sorted in increasing order; when formatting a list of (x,y) pairs, the pairs should be sorted in increasing order of x. In case of tie, smaller y comes first.
Input
There will be at most 1000 sub-problems, one in each line, formatted as above. The coordinates will be integers with absolute value not greater than 1000. The input is terminated by end of file (EOF).
Output
For each input line, print out your answer formatted as stated in the problem description. Each number in the output should be rounded to six digits after the decimal point. Note that the list should be enclosed by square brackets, and tuples should be enclosed by brackets. There should be no space characters in each line of your output.
Sample Input
CircumscribedCircle 0 0 20 1 8 17
InscribedCircle 0 0 20 1 8 17
TangentLineThroughPoint 200 200 100 40 150
TangentLineThroughPoint 200 200 100 200 100
TangentLineThroughPoint 200 200 100 270 210
CircleThroughAPointAndTangentToALineWithRadius 100 200 75 190 185 65 100
CircleThroughAPointAndTangentToALineWithRadius 75 190 75 190 185 65 100
CircleThroughAPointAndTangentToALineWithRadius 100 300 100 100 200 100 100
CircleThroughAPointAndTangentToALineWithRadius 100 300 100 100 200 100 99
CircleTangentToTwoLinesWithRadius 50 80 320 190 85 190 125 40 30
CircleTangentToTwoDisjointCirclesWithRadius 120 200 50 210 150 30 25
CircleTangentToTwoDisjointCirclesWithRadius 100 100 80 300 250 70 50
Output for the Sample Input
(9.734940,5.801205,11.332389)
(9.113006,6.107686,5.644984)
[53.977231,160.730818]
[0.000000]
[]
[(112.047575,299.271627),(199.997744,199.328253)]
[(-0.071352,123.937211),(150.071352,256.062789)]
[(100.000000,200.000000)]
[]
[(72.231286,121.451368),(87.815122,63.011983),(128.242785,144.270867),(143.826621,85.831483)]
[(157.131525,134.836744),(194.943947,202.899105)]
[(204.000000,178.000000)]
1.三角形外接圆
2.三角形内切圆
3.点到圆的切线的极角，可能有0，1，2条切线
4.经过给定点的圆和给定直线相切，求圆心位置，可以转化为圆与直线的交点
5.半径为 rr 的圆与两条给定直线相切，求圆心位置，将两条直线分别延法线方向上移/下移 rr 距离得到四条新直线，进而求出四个交点即为圆心位置
6. 同时与给定的两个相离的圆外切的 半径为 rr 圆的圆心，可以转化为两个半径加上 rr 的大圆的交点
AC code
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
using namespace std;
const double eps = 1e-8;
const double inf = 1e20;
const double pi = acos(-1.0);
const int maxn = 1010;
int sgn(double x){
if(fabs(x)<eps)return 0;
if(x<0)return -1;
else return 1;
}
struct Point {
double x,y;
Point (){};
Point (double _x,double _y){
x=_x;y=_y;
}
void input(){
scanf("%lf%lf",&x,&y);
}
bool operator < (Point b)const{
return sgn(x-b.x)==0?sgn(y-b.y)<0:x<b.x;
}
bool operator == (Point b)const{
return sgn(x-b.x)==0&&sgn(y-b.y)==0;
}
Point operator + (const Point &b)const{
return Point(x+b.x,y+b.y);
}
Point operator - (const Point &b)const{
return Point(x-b.x,y-b.y);
}
Point operator / (const double &b)const{
return Point (x/b,y/b);
}
Point operator * (const double &b)const{
return Point (x*b,y*b);
}
double operator ^ (const Point &b)const{
return x*b.y-y*b.x;
}
double operator * (const Point &b)const{
return x*b.x+y*b.y;
}
double len(){
return hypot(x,y);
}
double len2(){
return x*x+y*y;
}
Point trunc(double r){
double l=len();
if(!sgn(l))return *this;
r/=l;
return Point(x*r,y*r);
}
Point rotleft(){
return Point(-y,x);
}
Point rotright(){
return Point(y,-x);
}
double distance (Point p){
return hypot(x-p.x,y-p.y);
}
};
struct Line{
Point s,e;
Line(){};
Line(Point _s,Point _e){
s=_s;e=_e;
}
void input(){
s.input();
e.input();
}
double legth(){
return s.distance (e);
}
double angle(){
double k=atan2(e.y-s.y,e.x-s.x);
if(sgn(k)<0)k+=pi;
if(sgn(k-pi)==0)k-=pi;
return k;
}
Point cross_point(Line v){
double a1 = (v.e-v.s)^(s-v.s);
double a2 = (v.e-v.s)^(e-v.s);
return Point ((s.x*a2-e.x*a1)/(a2-a1),(s.y*a2-e.y*a1)/(a2-a1));
}
double dis_point_to_line(Point p){
return fabs((p-s)^(e-s))/legth();
}
double dis_point_to_seg(Point p){
if(sgn((p-s)*(e-s))<0||sgn((p-e)*(s-e))<0)
return min(p.distance(s),p.distance(e));
return dis_point_to_line(p);
}
//返回点p在直线上的投影
Point line_prog(Point p){
return s+(((e-s)*((e-s)*(p-s)))/((e-s).len2()));
}
bool parallel (Line v){
return sgn((e-s)^(v.e-v.s))==0;
}
};
struct circle{
Point p;
double r;
circle(){};
circle(Point _p,double _r){
p=_p;
r=_r;
}
circle(double x,double y,double _r){
p=Point(x,y);
r=_r;
}
//三角形的外接圆
circle(Point a,Point b,Point c){
Line u = Line((a+b)/2,((a+b)/2)+((b-a).rotleft()));
Line v = Line((b+c)/2,((b+c)/2)+((c-b).rotleft()));
p = u.cross_point(v);
r = p.distance(a);
}
//三角形内切圆
circle(Point a,Point b,Point c,bool t){
Line u,v;
double m = atan2(b.y-a.y,b.x-a.x), n = atan2(c.y-a.y,c.x-a.x);
u.s=a;
u.e=u.s+Point(cos((n+m)/2),sin((n+m)/2));
v.s=b;
m=atan2(a.y-b.y,a.x-b.x), n= atan2(c.y-b.y,c.x-b.x);
v.e = v.s+Point(cos((n+m)/2),sin((n+m)/2));
p = u.cross_point(v);
r = Line(a,b).dis_point_to_seg(p);
}
void input(){
p.input();
scanf("%lf",&r);
}
int relation_point(Point b){
double dist = b.distance(p);
if(sgn(dist - r)<0)return 2;
else if(sgn(dist - r)==0) return 1;
return 0;
}
//求直线和圆的交点
int relation_line(Line v){
double dist = v.dis_point_to_line(p);
if(sgn(dist-r)<0)return 2;
else if(sgn(dist-r)==0) return 1;
return 0;
}
int relation_circle(circle v){
double d = p.distance(v.p);
if(sgn(d-r-v.r)>0)return 5;
if(sgn(d-r-v.r)==0)return 4;
double l =fabs(r-v.r);
if(sgn(d-r-v.r)<0&&sgn(d-l)>0)return 3;
if(sgn(d-l)==0)return 2;
if(sgn(d-l)<0)return 1;
}
int point_cross_line(Line v,Point &p1,Point &p2){
if(!(*this).relation_line(v))return 0;
Point a = v.line_prog(p);
double d = v.dis_point_to_line(p);
d = sqrt(r*r-d*d);
if(sgn(d)==0){
p1=a;
p2=a;
return 1;
}
p1 = a+(v.e-v.s).trunc(d);
p2 = a-(v.e-v.s).trunc(d);
return 2;
}
int point_cross_circle(circle v,Point &p1,Point &p2){
int rel = relation_circle(v);
if(rel==1||rel==5)return 0;
double d = p.distance(v.p);
double l = (d*d+r*r-v.r*v.r)/(2*d);
double h = sqrt(r*r-l*l);
Point temp = p+(v.p-p).trunc(l);
p1=temp + ((v.p-p).rotleft().trunc(h));
p2=temp + ((v.p-p).rotright().trunc(h));
if(rel == 2||rel ==4){
return 1;
}
return 2;
}
int tangent_line(Point q,Line &u,Line &v){
int x = relation_point(q);
if(x==2) return 0;
if(x==1){
u=Line(q,q+(q-p).rotleft());
v=u;
return 1;
}
double d=p.distance (q);
double l=r*r/d;
double h=sqrt(r*r-l*l);
u=Line(q,p+((q-p).trunc(l)+(q-p).rotleft().trunc(h)));
v=Line(q,p+((q-p).trunc(l)+(q-p).rotright().trunc(h)));
return 2;
}
//得过与直线u相切，过点q，半径为r1的圆
int get_circle(Line u,Point q,double r1,circle &c1,circle &c2){
double dis=u.dis_point_to_line(q);
if(sgn(dis-r1*2)>0)return 0;
if(sgn(dis)==0){
c1.p=q+((u.e-u.s).rotleft().trunc(r1));
c2.p=q+((u.e-u.s).rotright().trunc(r1));
c1.r=c2.r=r1;
return 2;
}
Line u1=Line((u.s+(u.e-u.s).rotleft().trunc(r1)),(u.e+(u.e-u.s).rotleft().trunc(r1)));
Line u2=Line((u.s+(u.e-u.s).rotright().trunc(r1)),(u.e+(u.e-u.s).rotright().trunc(r1)));
circle cc=circle(q,r1);
Point p1,p2;
if(!cc.point_cross_line(u1,p1,p2))cc.point_cross_line(u2,p1,p2);
c1=circle(p1,r1);
if(p1==p2){
c2=c1;
return 1;
}
c2=circle(p2,r1);
return 2;
}
//同时与直线u，v相切，半径为r1的圆;
int get_circle(Line u,Line v,double r1,circle &c1,circle &c2,circle &c3,circle &c4){
if(u.parallel(v))return 0;
Line u1=Line(u.s+(u.e-u.s).rotleft().trunc(r1),u.e+(u.e-u.s).rotleft().trunc(r1));
Line u2=Line(u.s+(u.e-u.s).rotright().trunc(r1),u.e+(u.e-u.s).rotright().trunc(r1));
Line v1=Line(v.s+(v.e-v.s).rotleft().trunc(r1),v.e+(v.e-v.s).rotleft().trunc(r1));
Line v2=Line(v.s+(v.e-v.s).rotright().trunc(r1),v.e+(v.e-v.s).rotright().trunc(r1));
c1.r=c2.r=c3.r=c4.r=r1;
c1.p=u1.cross_point(v1);
c2.p=u1.cross_point(v2);
c3.p=u2.cross_point(v1);
c4.p=u2.cross_point(v2);
return 4;
}
//同时与不相交的两个圆cx,cy相切 ，半径为r1的圆
int get_circle(circle cx,circle cy,double r1,circle &c1,circle &c2){
circle x(cx.p,r1+cx.r),y(cy.p,r1+cy.r);
int t=x.point_cross_circle(y,c1.p,c2.p);
if(!t)return 0;
c1.r=c2.r=r1;
return t;
}
};
int main()
{
string s;
while(cin>>s){
if(s=="CircumscribedCircle"){
Point a1,a2,a3;
a1.input();
a2.input();
a3.input();
circle ans(a1,a2,a3);
printf("(%.6lf,%.6lf,%.6lf)\n",ans.p.x,ans.p.y,ans.r);
}
if(s=="InscribedCircle"){
Point a1,a2,a3;
a1.input();
a2.input();
a3.input();
circle ans(a1,a2,a3,true);
printf("(%.6lf,%.6lf,%.6lf)\n",ans.p.x,ans.p.y,ans.r);
}
if(s=="TangentLineThroughPoint"){
circle c;
c.input();
Point pp;
pp.input();
Line uu,vv;
int ans=c.tangent_line(pp,uu,vv);
if(ans==0)printf("[]\n");
if(ans==1)printf("[%.6lf]\n",uu.angle()/pi*180.0);
if(ans==2){
double res[5];
res[0]=uu.angle();res[1]=vv.angle();
sort(res,res+2);
printf("[%.6lf,%.6lf]\n",res[0]/pi*180.0,res[1]/pi*180.0);
}
}
if(s=="CircleThroughAPointAndTangentToALineWithRadius"){
Point pp;
pp.input();
Line uu;
uu.input();
double rr;
scanf("%lf",&rr);
circle c,c1,c2;
int ans=c.get_circle(uu,pp,rr,c1,c2);
if(ans==0)printf("[]\n");
if(ans==1)printf("[(%.6lf,%.6lf)]\n",c1.p.x,c1.p.y);
if(ans==2){
Point yx[5];
yx[0]=c1.p;
yx[1]=c2.p;
sort(yx,yx+2);
printf("[(%.6lf,%.6lf),(%.6lf,%.6lf)]\n",yx[0].x,yx[0].y,yx[1].x,yx[1].y);
}
}
if(s=="CircleTangentToTwoLinesWithRadius"){
Line u,v;
double r1;
circle c,c1,c2,c3,c4;
u.input();
v.input();
scanf("%lf",&r1);
c.get_circle(u,v,r1,c1,c2,c3,c4);
Point yx[5];
yx[0]=c1.p;
yx[1]=c2.p;
yx[2]=c3.p;
yx[3]=c4.p;
sort(yx,yx+4);
printf("[(%.6lf,%.6lf),(%.6lf,%.6lf),(%.6lf,%.6lf),(%.6lf,%.6lf)]\n",
yx[0].x,yx[0].y,yx[1].x,yx[1].y,yx[2].x,yx[2].y,yx[3].x,yx[3].y);
}
if(s=="CircleTangentToTwoDisjointCirclesWithRadius"){
circle c,cx,cy,c1,c2;
cx.input();
cy.input();
double r1;
scanf("%lf",&r1);
int ans=c.get_circle(cx,cy,r1,c1,c2);
if(ans==0)printf("[]\n");
if(ans==1)printf("[(%.6lf,%.6lf)]\n",c1.p.x,c1.p.y);
if(ans==2){
Point yx[5];
yx[0]=c1.p;
yx[1]=c2.p;
sort(yx,yx+2);
printf("[(%.6lf,%.6lf),(%.6lf,%.6lf)]\n",yx[0].x,yx[0].y,yx[1].x,yx[1].y);
}
}
}
}
1723
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
