.png){kind=icon}
Return
Robust interval algorithm for surface intersections
.png){kind=icon}
PRE
AI
DOI：10.1016/S0010-4485(96)00099-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we develop robust algorithms for computing interval polynomial curve-to-surface and surface-to-surface intersections. These include well-conditioned transversal intersections as well as ill-conditioned non-transversal intersections. Key components of our methods are the reduction of the intersection problems into solving balanced or unbalanced systems of non-linear interval polynomial equations. These systems are solved using an interval non-linear polynomial solver based on Bernstein subdivision coupled with rounded interval arithmetic, documented in a series of earlier papers. The solver provides results with numerical certainty and verifiability. Examples illustrate our techniques. We also provide a theoretical analysis of degenerate interval polynomial curve-to-surface and surface-to-surface ill-conditioned non-transversal intersections. (C) 1997 Elsevier Science Ltd.
Keywords:
CAD
CAGD
CAM
surface intersection
rounded interval arithmetic
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
.png){kind=icon}
ShareSaveShareSaveShareSaveImproving Transitions of Care: Designing a Blockchain Application for Patient Identity Management
OAAI
OAAIShareSaveShareSaveShareSave
View more