Details:
Title  Computing curve intersection by homotopy methods  Author(s)  Erbao Feng, Wenyu Hu, Zhongxuan Luo  Type  Article in Journal  Abstract  Intersection problems are fundamental in computational geometry, geometric modeling and design and manufacturing applications, and can be reduced to solving polynomial systems. This paper introduces two homotopy methods, i.e. polyhedral homotopy method and linear homotopy method, to compute the intersections of two plane rational parametric curves. Extensive numerical examples show that computing curve intersection by homotopy methods has better accuracy, efficiency and robustness than by the Ehrlich–Aberth iteration method. Finally, some other applications of homotopy methods are also presented.  Keywords  Curve intersection, Surface intersection, Characteristic point, Polyhedral homotopy, Linear homotopy  ISSN  03770427 
URL 
http://www.sciencedirect.com/science/article/pii/S0377042711002627 
Language  English  Journal  Journal of Computational and Applied Mathematics  Volume  236  Number  5  Pages  892  905  Year  2011  Note  The 7th International Conference on Scientific Computing and Applications, June 13–16, 2010, Dalian, China  Edition  0  Translation 
No  Refereed 
No 
