Opencascade中对于空间曲线求交的方法

最新推荐文章于 2024-09-08 13:09:05 发布

DW257

最新推荐文章于 2024-09-08 13:09:05 发布

阅读量6.4k

点赞数 1

分类专栏： Opencascade

本文链接：https://blog.csdn.net/u012689172/article/details/37567369

版权

本文介绍了OpenCASCADE（OCC）中两种求曲线交点的方法：GeomAPI_ExtremaCurveCurve和Geom2dAPI_InterCurveCurve。GeomAPI_ExtremaCurveCurve主要计算曲线间的最近距离，也可用于求交，尤其在相切情况下。而Extrema包提供了计算极值的功能，包括点、曲线、曲面之间的最小距离。此外，Geom2dAPI_InterCurveCurve专门用于二维曲线的求交。

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

occ中曲线求交点目前发现了两种方法：

一 GeomAPI_ExtremaCurveCurve方法

此类的声明：

Describes functions for computing all the extrema 
//! between two 3D curves. 
//! An ExtremaCurveCurve algorithm minimizes or 
//! maximizes the distance between a point on the first 
//! curve and a point on the second curve. Thus, it 
//! computes start and end points of perpendiculars 
//! common to the two curves (an intersection point is 
//! not an extremum unless the two curves are tangential at this point). 
//! Solutions consist of pairs of points, and an extremum 
//! is considered to be a segment joining the two points of a solution. 
//! An ExtremaCurveCurve object provides a framework for: 
//! - defining the construction of the extrema, 
//! - implementing the construction algorithm, and 
//! - consulting the results. 
//! Warning 
//! In some cases, the nearest points between two 
//! curves do not correspond to one of the computed 
//! extrema. Instead, they may be given by: 
//! - a limit point of one curve and one of the following: 
//! - its orthogonal projection on the other curve, 
//! - a limit point of the other curve; or 
//! - an intersection point between the two curves.