A hybrid method for computing the intersection and tangency points of plane curves

作者:

Highlights:

摘要

In this paper we present a symbolic-numeric (hybrid) method for computing the intersection and tangency points of given plane curves. The whole procedure involves three phases: (i) implicitization, (ii) root specification, and (iii) inversion. For each one of these phases we propose an appropriate algorithm fully documented regarding its complexity and stability. A comparison with other existing methods is also provided. All the proposed methods are illustrated through examples.

论文关键词:Curve intersection,Tangency points,Implicitization,Root specification,Inversion,Sylvester Matrix,Complexity

论文评审过程:Available online 12 September 2012.

论文官网地址:https://doi.org/10.1016/j.amc.2012.08.039