Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
