返回
Robust Algebraic Curve Intersections with Tolerance Control
DOI:10.1016/j.cad.2022.103236.png)
摘要
En 中文
In this paper, a robust and efficient algorithm is proposed to calculate the intersection points of two planar algebraic curves with guaranteed tolerance. The proposed method takes advantage of the fundamental methods in the fields of CAGD, solution verification for nonlinear equations and symbolic computation. Specifically, the subdivision method is applied to quickly exclude the regions without intersection points, and then Krawczyk's method is used to find a sharp and guaranteed bound for the intersection points. For ill-conditional cases, Sturm's theorem is applied to determine if there are any intersection points in undetermined regions. We present examples to demonstrate the robustness and efficiency of our algorithm, and comparisons with classic methods and a state-of-the-art method are also provided. The method can be easily adapted to computing the intersection points of two parametric curves. (C)& nbsp;2022 Elsevier Ltd. All rights reserved.
Keyword:
Algebraic curve
Curve/curve intersection
Subdivision method
Krawczyk's method
Sturm's theorem
Resultant
期刊
C
IF:
3.1
论文数:
3.2K
被引数:
6.4K
机构
引用论文
Lattice dynamics and statistical mechanics of the Fm3m → I4/m structural phase transition in Rb2KInF6Fm3m → I4/m结构相变在Rb2KInF6中的晶格动力学与统计力学
meso-Tetrakis(ethylenediamine)-1κ4N,N′;3κ4N,N′-di-μ-sulfidoacetato-1:2κ3O,S:S;2:3κ3S:S,O-dicobalt(III)silver(I) triperchloratemeso-四(乙二胺)-1κ4N,N′;3κ4N,N′-双-μ-硫代乙酸根-1:2κ3O,S:S;2:3κ3S:S,O-双钴(III)银(I)高氯酸三盐

