.png){kind=icon}
Return
Robust interval algorithm for curve intersections
.png){kind=icon}
PRE
AI
DOI：10.1016/0010-4485(95)00063-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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
Keywords:
CAD
CAGD
CAM
curve intersection
tangency
overlapping
rounded interval arithmetic
interval polynomial solver
robustness
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.1
Papers:
3.1K
Citations:
6.4K
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSave
Improving Transitions of Care: Designing a Blockchain Application for Patient Identity Management
OAAI
OAAIShareSaveInfluence of ionic liquid-modified LDH on microwave-assisted polymerization of ε-caprolactone.png)
Polymer
PolymerIF0
PREAI
ShareSaveShareSave
View more