#include <stdio.h> #include <stdint.h>typedef struct{float x;float y; }Point_t; typedef struct{float x; //交點(diǎn)的x坐標(biāo)float y; //交點(diǎn)的y坐標(biāo)uint8_t inl1;//是否在l1線段內(nèi)uint8_t inl2;//是否在l1線段內(nèi)uint8_t parallel;//兩條線是否平行 }PointRet_t;/** 判斷某個(gè)值是否包含于某個(gè)區(qū)間，區(qū)間無序，小邊界取等* x [I]需要判斷的值* c1 [I]區(qū)間邊界1* c2 [I]區(qū)間邊界2* 返回： 0 不包含 1包含 */ uint8_t Get_IsContain(float x,float c1,float c2) {float max,min;//排序if(c1>c2){max = c1;min = c2;}else{max = c2;min = c1;}if((x>=min)&&(x<max))return 1;return 0; }/** 通過四個(gè)點(diǎn)獲得兩條直線的交點(diǎn)* L1s [I]第一條直線的起點(diǎn)* L1e [I]第一條直線的終點(diǎn)* L2e [I]第二條直線的起點(diǎn)* L2e [I]第二條直線的終點(diǎn)* outPoint [O]直線的交點(diǎn)* 返回 交點(diǎn)描述 */ PointRet_t Get_Intersection(Point_t L1s,Point_t L1e,Point_t L2s,Point_t L2e) {PointRet_t ret={0};float kl1 = 0,x1 = 1;float kl2 = 0,x2 = 1;//計(jì)算k值if((L1e.x - L1s.x)!=0)kl1 = (L1e.y - L1s.y)/(L1e.x - L1s.x);else x1 = 0;if((L2e.x - L2s.x)!=0)kl2 = (L2e.y - L2s.y)/(L2e.x - L2s.x);else x2 = 0;//判斷平行if(kl1 == kl2){//兩條線平行ret.parallel = 1;return ret;}//計(jì)算交叉點(diǎn)//y軸線處理if(x1 == 0){ret.x = L1e.x;ret.y = kl2*(ret.x - L2s.x) + L2s.y;}if(x2 == 0){ret.x = L2e.x;ret.y = kl1*(ret.x - L1s.x) + L1s.y;}//普通線if((x1 !=0)&&(x2 !=0)){ret.x = (kl1*L1s.x-kl2*L2s.x-L1s.y+L2s.y)/(kl1-kl2);ret.y = kl1*(ret.x - L1s.x) + L1s.y;}//判斷是否包含if(Get_IsContain(ret.x,L1s.x,L1e.x)&&Get_IsContain(ret.y,L1s.y,L1e.y))ret.inl1 = 1;if(Get_IsContain(ret.x,L2s.x,L2e.x)&&Get_IsContain(ret.y,L2s.y,L2e.y))ret.inl2 = 1;return ret; }int main() {Point_t L1e = {.x=-2,.y=-2.2};Point_t L1s = {.x=0,.y=0.8};Point_t L2s = {.x=-2,.y=-0.8};Point_t L2e = {.x=6,.y=0};PointRet_t Ret = Get_Intersection(L1s,L1e,L2s,L2e);printf("Ret x=%f y=%f l1=%d l2=%d parallel = %d \r\n",Ret.x,Ret.y,Ret.inl1,Ret.inl2,Ret.parallel);return 0; }

總結(jié)

以上是生活随笔為你收集整理的C 通过四个点计算两条直线的交点的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。