点击次数：

论文类型：期刊论文

发表时间：2011-10-01

发表刊物：7th International Conference on Scientific Computing and Applications

收录刊物：SCIE、EI、CPCI-S、Scopus

卷号：236

期号：5,SI

页面范围：892-905

ISSN号：0377-0427

关键字：Curve intersection; Surface intersection; Characteristic point; Polyhedral homotopy; Linear homotopy

摘要：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. (C) 2011 Elsevier B.V. All rights reserved.