UVA 11178 Morley's Theorem 计算几何
来源:互联网 发布:js join后数组合并 编辑:程序博客网 时间:2024/04/29 07:22
计算几何: 最基本的计算几何,差积 旋转
Morley's Theorem
Submit Status
Description
Problem D
Morley’s Theorem
Input: Standard Input
Output: Standard Output
Morley’s theorem states that that the lines trisecting the angles of an arbitrary plane triangle meet at the vertices of an equilateral triangle. For example in the figure below the tri-sectors of angles A, B and C has intersected and created an equilateral triangle DEF.
Of course the theorem has various generalizations, in particular if all of the tri-sectors are intersected one obtains four other equilateral triangles. But in the original theorem only tri-sectors nearest to BC are allowed to intersect to get point D, tri-sectors nearest to CA are allowed to intersect point E and tri-sectors nearest to AB are intersected to get point F. Trisectorlike BD and CE are not allowed to intersect. So ultimately we get only one equilateral triangle DEF. Now your task is to find the Cartesian coordinates of D, E and F given the coordinates of A, B, and C.
Input
First line of the input file contains an integer N (0<N<5001) which denotes the number of test cases to follow. Each of the next lines contain six integers . This six integers actually indicates that the Cartesian coordinates of point A, B and C are respectively. You can assume that the area of triangle ABC is not equal to zero, and the points A, B and C are in counter clockwise order.
Output
For each line of input you should produce one line of output. This line contains six floating point numbers separated by a single space. These six floating-point actually means that the Cartesian coordinates of D, E and F are respectively. Errors less than will be accepted.
Sample Input Output for Sample Input
2
1 1 2 2 1 2
0 0 100 0 50 50
1.316987 1.816987 1.183013 1.683013 1.366025 1.633975
56.698730 25.000000 43.301270 25.000000 50.000000 13.397460
Problemsetters: Shahriar Manzoor
Special Thanks: Joachim Wulff
Source
Root :: AOAPC I: Beginning Algorithm Contests -- Training Guide (Rujia Liu) :: Chapter 4. Geometry :: Geometric Computations in 2D :: Examples
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>using namespace std;const double eps=1e-8;int dcmp(double x){ if(fabs(x)<eps) return 0; else return (x<0)?-1:1;}struct Point{ double x,y; Point(double _x=0,double _y=0):x(_x),y(_y){}};Point operator+(Point A,Point B) {return Point(A.x+B.x,A.y+B.y);}Point operator-(Point A,Point B) {return Point(A.x-B.x,A.y-B.y);}Point operator*(Point A,double p) {return Point(A.x*p,A.y*p);}Point operator/(Point A,double p) {return Point(A.x/p,A.y/p);}Point A,B,C;double Dot(Point A,Point B) {return A.x*B.x+A.y*B.y;}double Length(Point A) {return sqrt(Dot(A,A));}double Angle(Point A,Point B) {return acos(Dot(A,B)/Length(A)/Length(B));}double angle(Point v) {return atan2(v.y,v.x);}double Cross(Point A,Point B) {return A.x*B.y-A.y*B.x;}Point Rotate(Point A,double rad){ return Point(A.x*cos(rad)-A.y*sin(rad),A.x*sin(rad)+A.y*cos(rad));}Point GetLineIntersection(Point p,Point v,Point q,Point w){ Point u=p-q; double t=Cross(w,u)/Cross(v,w); return p+v*t;}Point getD(Point A,Point B,Point C){ Point v1=C-B; double a1=Angle(A-B,v1); v1=Rotate(v1,a1/3); Point v2=B-C; double a2=Angle(A-C,v2); v2=Rotate(v2,-a2/3); return GetLineIntersection(B,v1,C,v2);}int main(){ int T_T; scanf("%d",&T_T); while(T_T--) { for(int i=0;i<3;i++) { double x,y; scanf("%lf%lf",&x,&y); if(i==0) A=(Point){x,y}; else if(i==1) B=(Point){x,y}; else if(i==2) C=(Point){x,y}; } Point D=getD(A,B,C); Point E=getD(B,C,A); Point F=getD(C,A,B); printf("%.6lf %.6lf %.6lf %.6lf %.6lf %.6lf\n",D.x,D.y,E.x,E.y,F.x,F.y); } return 0;}
- UVA 11178 Morley's Theorem 计算几何
- UVA 11178 - Morley's Theorem(计算几何)
- UVA 11178 Morley's Theorem 计算几何
- uva 011178 Morley's Theorem 计算几何
- UVA 11178 Morley's Theorem(计算几何入门)
- UVA 11178 - Morley's Theorem 简单的计算几何
- UVA 11178 Morley’s Theorem(二维计算几何基础)
- UVA - 11178 - Morley's Theorem (计算几何~~)
- UVA 11178 Morley’s Theorem(计算几何直线的交点)
- UVA-11178 - Morley's Theorem(计算几何)
- UVa 11178 Morley's Theorem(几何)
- UVA - 11178 Morley's Theorem //几何初探
- uva 11178 - Morley's Theorem(几何)
- Uva 11178 Morley's Theorem (几何+模拟)
- UVA 11178 Morley's Theorem(几何)
- 11178 - Morley's Theorem【几何】
- uva 11178 Morley's Theorem(计算几何-点和直线)
- UVA 11178 Morley’s Theorem(莫雷定理 计算几何)
- zoj1154
- 【软考】计算机硬件组成
- Axure RP 7.0注册码及汉化包
- Can We Make Operating Systems Reliable and Secure?
- 三种不同样式的打开折叠内容,包括同时折叠多个
- UVA 11178 Morley's Theorem 计算几何
- STL中用ERASE()方法遍历删除元素
- VS2012+OpenCV246 读入图片并修改像素值
- 线程安全通用数据类型类
- elf文件格式实例分析
- [LeetCode]Add Binary
- 中科燕园GIS外包团队(手机:13261043797,QQ:1216807928)项目案例 --gis与智慧应急
- 八大排序算法
- java编程思想笔记