【摘要】 提出一种构造C-型双圆弧和S-型双圆弧的算法,该双圆弧的2个端点为给定的点,在端点处的2个切向量为给定的切向量,且完全位于一条给定直线的一侧.对于C-型双圆弧,分12种情况给出不等式直接判断双圆弧是否满足位于给定直线一侧的约束条件.如果存在多个同时满足插值条件和直线约束条件的双圆弧,则通过求解一个最小值问题选出最优的双圆弧;否则,通过添加一个额外的点构造2段双圆弧.对于S-型双圆弧也给出一些带直线约束的插值结果.更多还原

【Abstract】 An algorithm to construct biarcs that not only match the interpolation requirement of the point positions and tangent vectors but also lie on one side of the constraint line is proposed.For C-type biarc interpolation with the line constraint,firstly twelve inequalities in total are provided according to different position relationships between the constraint line and the interpolation requirement.These inequalities are used to check if biarcs lie on one side of the constraint line.If there exist many biarcs satisfying both the interpolation requirement and the line constraint,the optimal biarc can be obtained by solving a minimum problem.Otherwise,one extra point is added to make it possible to obtain biarcs.For S-type biarc interpolation with the line constraint,some results are also listed.更多还原