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 1 1
外部発表Yes

Fingerprint

Polynomials

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Industrial and Manufacturing Engineering

これを引用

Hu, C. Y., Maekawa, T., Sherbrooke, E. C., & Patrikalakis, N. M. (1996). Robust interval algorithm for curve intersections. CAD Computer Aided Design, 28(6-7), 495-506. https://doi.org/10.1016/0010-4485(95)00063-1

Robust interval algorithm for curve intersections. / Hu, Chun Yi; Maekawa, Takashi; Sherbrooke, Evan C.; Patrikalakis, Nicholas M.

:: CAD Computer Aided Design, 巻 28, 番号 6-7, 01.01.1996, p. 495-506.

研究成果: Article

Hu, CY, Maekawa, T, Sherbrooke, EC & Patrikalakis, NM 1996, 'Robust interval algorithm for curve intersections', CAD Computer Aided Design, 巻. 28, 番号 6-7, pp. 495-506. https://doi.org/10.1016/0010-4485(95)00063-1
Hu CY, Maekawa T, Sherbrooke EC, Patrikalakis NM. Robust interval algorithm for curve intersections. CAD Computer Aided Design. 1996 1 1;28(6-7):495-506. https://doi.org/10.1016/0010-4485(95)00063-1
Hu, Chun Yi ; Maekawa, Takashi ; Sherbrooke, Evan C. ; Patrikalakis, Nicholas M. / Robust interval algorithm for curve intersections. :: CAD Computer Aided Design. 1996 ; 巻 28, 番号 6-7. pp. 495-506.
@article{8375cf527dd34c049ac11068c0ff2b13,
title = "Robust interval algorithm for curve intersections",
abstract = "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.",
keywords = "CAD, CAGD, CAM, Curve intersection, Interval polynomial solver, Overlapping, Robustness, Rounded interval arithmetic, Tangency",
author = "Hu, {Chun Yi} and Takashi Maekawa and Sherbrooke, {Evan C.} and Patrikalakis, {Nicholas M.}",
year = "1996",
month = "1",
day = "1",
doi = "10.1016/0010-4485(95)00063-1",
language = "English",
volume = "28",
pages = "495--506",
journal = "CAD Computer Aided Design",
issn = "0010-4485",
publisher = "Elsevier Limited",
number = "6-7",

}

TY - JOUR

T1 - Robust interval algorithm for curve intersections

AU - Hu, Chun Yi

AU - Maekawa, Takashi

AU - Sherbrooke, Evan C.

AU - Patrikalakis, Nicholas M.

PY - 1996/1/1

Y1 - 1996/1/1

N2 - 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.

AB - 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.

KW - CAD

KW - CAGD

KW - CAM

KW - Curve intersection

KW - Interval polynomial solver

KW - Overlapping

KW - Robustness

KW - Rounded interval arithmetic

KW - Tangency

UR - http://www.scopus.com/inward/record.url?scp=0001406461&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0001406461&partnerID=8YFLogxK

U2 - 10.1016/0010-4485(95)00063-1

DO - 10.1016/0010-4485(95)00063-1

M3 - Article

AN - SCOPUS:0001406461

VL - 28

SP - 495

EP - 506

JO - CAD Computer Aided Design

JF - CAD Computer Aided Design

SN - 0010-4485

IS - 6-7

ER -