Robust interval algorithm for curve intersections

Chun Yi Hu*, Takashi Maekawa, Evan C. Sherbrooke, Nicholas M. Patrikalakis

*この研究の対応する著者

研究成果: Article査読

53 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)495-506
ページ数12
ジャーナルCAD Computer Aided Design
28
6-7
DOI
出版ステータスPublished - 1996
外部発表はい

ASJC Scopus subject areas

  • コンピュータ サイエンスの応用
  • コンピュータ グラフィックスおよびコンピュータ支援設計
  • 産業および生産工学

フィンガープリント

「Robust interval algorithm for curve intersections」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル