数据结构
网络
关系型数据库管理系统
操作系统
Java
MS Excel
iOS
HTML
CSS
Android
Python
C 语言编程
C++
C#
MongoDB
MySQL
Javascript
PHP
物理
化学
生物
数学
英语
经济学
心理学
社会研究
时装研究
法律研究C++ 程序用来在以上和以下基本方法中测试两条线是否相交
下面是一个 C++ 程序，用来在以上和以下基本方法中测试两条线是否相交。这可用来测试一条线是否与线段相交。当且仅当线段的一个端点在直线的左边，另一个端点在直线的右边时，才会相交。
算法
Begin For generating equation of the first line, generate random numbers for coefficient of x and y by using rand at every time of compilation. For generating equation of the second line, generate random numbers for coefficient of x and y by using rand at every time of compilation. Find the segment of line 1 as Y1. if (Y1 < 0) Find the segment of line 2 if (Y2 >= 0) print they are intersecting. else if (Y2 < 0) print they are not intersecting. else if (Y1 >0) Find the segment of line 2 if (Y2 <= 0) print they are intersecting. else if (Y2 >0) print they are not intersecting. End.
示例代码
#include<time.h>
#include<stdlib.h>
#include<iostream>
#include<math.h>
using namespace std;
const int L = 2;
const int H= 20;
int main(int argc, char **argv) {
time_t s;
time(&s);
srand((unsigned int) s);
int x1, x2, y1, y2;
x1 = rand() % (H - L+ 1) + L;
x2 = rand() % (H - L+ 1) + L;
y1 = rand() % (H- L+ 1) + L;
y2 = rand() % (H - L + 1) + L;
cout << "The Equation of the 1st line is : (" << (y2 - y1) << ")x+(" << (x1 - x2) << ")y+(" << (x2 * y1 - x1 * y2) << ") = 0\n";
int p1, p2, q1, q2;
p1 = rand() % (H- L+ 1) + L;
p2 = rand() % (H- L + 1) + L;
q1 = rand() % (H - L + 1) + L;
q2 = rand() % (H - L + 1) + L;
cout << "The Equation of the 2nd line is : (" << (q2 - q1) << ")x+(" << (p1 - p2) << ")y+(" << (p2 * q1 - p1 * q2) << ") = 0\n";
int Y1 = (y2 - y1) * p1 + (x1 - x2) * q1 + (x2 * y1 - x1 * y2); //Y1 segment
if (Y1 < 0) {
int Y2 = (y2 - y1) * p2 + (x1 - x2) * q2 + (x2 * y1 - x1 * y2); //Y2 segment
if (Y2 >= 0)
cout << "Lines are intersecting";
else if (Y2 < 0)
cout << "Lines are not intersecting";
} else if (Y1 >0) {
int Y2 = (y2 - y1) * p2 + (x1 - x2) * q2 + (x2 * y1 - x1 * y2);
if (Y2 <= 0)
cout << "Lines are intersecting";
else if (Y2 >0)
cout << "Lines are not intersecting";
} else
cout << "The point lies on the line";
return 0;
}输出
The Equation of the 1st line is : (-3)x+(2)y+(1) = 0 The Equation of the 2nd line is : (-5)x+(-5)y+(130) = 0 Lines are intersecting The Equation of the 1st line is : (-1)x+(7)y+(-15) = 0 The Equation of the 2nd line is : (-4)x+(4)y+(-8) = 0 Lines are not intersecting
更新于： 30-7 月-2019
173 次浏览
广告