cgal-空间直线的的最小距离

最新推荐文章于 2024-08-04 16:04:20 发布

J_Factory

最新推荐文章于 2024-08-04 16:04:20 发布

阅读量462

点赞数

分类专栏： CAGD 文章标签： parallel vector distance object

本文链接：https://blog.csdn.net/j_factory/article/details/5673307

版权

CAGD 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

本文介绍了一种算法，该算法通过计算3D空间中两条线段之间的最短连接线来找到一个点，这个点到两条线段的距离之和最短。具体步骤包括：确定包含一条线并平行于另一条线的平面，找到垂直于该平面并与第一条线相交的第二个平面，计算第二个平面上与第二条线的交点，投影此交点到第一条线上，并计算最终点。

摘要由CSDN通过智能技术生成

question:

have two lines/rays in 3d and want to get the shortest line that connects both (or similarly: the 3d point that has the shortest distance to both lines)

code :

// get plane p1 that contains l1 and is parallel to l2
Plane_3 p1( l1, l1.point(0) + l2.to_vector() );

// get plane p2 that contains l1 and is perpendicular to p1
Plane_3 p2( l1, l1.point(0) + p1.orthogonal_vector() );

// get intersection i1 between p2 and l2
Point_3 i1;
CGAL::Object result = CGAL::intersection( p2, l2 );
if( !assign( i1, result ) ) {
Line_3 il;
if( assign( il, result ) )
std::cout << "intersection between plane and line is a line --> l1 and l2 are parallel!" << std::endl;
return -1.0;
}

// get intersection i2 on l1
Point_3 i2 = l1.projection( i1 );

// final point is (i1+i2)/2
Point_3 f((i1.x() + i2.x()) / 2.0, (i1.y() + i2.y()) / 2.0, (i1.z() + i2.z()) / 2.0);