曲线/曲线求交的自适应迭代/细分混合算法
An adaptive iterative/subdivision hybrid algorithm for curve/curve intersection
摘要：
在[20]中提出的用于曲线/曲线相交的迭代/细分混合算法的行为取决于用于其收敛性测试的域的选择。使用太小或太大的测试域可能导致测试无法检测到牛顿法实际上收敛到解的情况，这导致不必要的额外细分，从而导致更多的计算时间。我们提出了一个修改的算法，自适应调整测试域的大小，根据发生了什么事在测试的父区域。这与原始算法形成鲜明对比，原始算法的测试域始终是所考虑的输入域的固定倍数。计算结果表明，该算法比原算法的效率略有提高。
英文摘要：
The behavior of the iterative/subdivision hybrid algorithm for curve/curve intersection proposed in [20] depends on the choice of the domain for their convergence test. Using either too small or too large test domain may cause the test to fail to detect cases where Newton's method in fact converges to a solution, which results in unnecessary additional subdivisions and consequently more computation time. We propose a modification to the algorithm to adaptively adjust the test domain size according to what happens during the test of the parent region. This is in contrast to the original algorithm whose test domain is always a fixed multiple of the input domain under consideration. Computational results show that the proposed algorithm is slightly more efficient than the original algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
