.png){kind=icon}
返回
Robust interval algorithm for curve intersections
.png){kind=icon}
PRE
AI
DOI：10.1016/0010-4485(95)00063-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we develop and study a robust algorithm for computing intersections of two planar interval polynomial curves. The intersection problems include well-conditioned transveral intersections as well as ill-conditioned cases such as tangential and overlapping intersections. Key components of our methods are the reduction of the intersection problems into solving systems of nonlinear interval polynomial equations which consist of m equations with n unknowns. An earlier interval nonlinear polynomial solver for balanced system based on Bernstein subdivision method coupled with rounded interval arithmetic is extended to solve unbalanced systems. The solver provides results with numerical certainty and verifiability. Examples illustrate our techniques. Copyright (C) 1996 Elsevier Science Ltd
Keyword:
CAD
CAGD
CAM
curve intersection
tangency
overlapping
rounded interval arithmetic
interval polynomial solver
robustness
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.1
论文数:
3.1K
被引数:
6.4K
机构
暂无机构信息
引用论文
分享收藏分享收藏
Improving Transitions of Care: Designing a Blockchain Application for Patient Identity Management
OAAI
OAAI分享收藏Influence of ionic liquid-modified LDH on microwave-assisted polymerization of ε-caprolactone.png)
Polymer
PolymerIF0
PREAI
分享收藏
查看更多内容