A Condition Number Analysis of a Line-Surface Intersection Algorithm

Details A Condition Number Analysis of a Line-Surface Intersection Algorithm A Condition Number Analysis of a Line-Surface Intersection Algorithm

2006-08-23

arxiv.org/abs/cs/0608090v2

Computer Science

Numerical Analysis

Scientific paper

We propose an algorithm based on Newton's method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has applications in graphics and computer-aided geometric design. The algorithm can operate on polynomials represented in any basis that satisfies a few conditions. The power basis, the Bernstein basis, and the first-kind Chebyshev basis are among those compatible with the algorithm. The main novelty of our algorithm is an analysis showing that its running is bounded only in terms of the condition number of the polynomial's zeros and a constant depending on the polynomial basis.

Affiliated with

Also associated with

No associations

Rating

A Condition Number Analysis of a Line-Surface Intersection Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Condition Number Analysis of a Line-Surface Intersection Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Condition Number Analysis of a Line-Surface Intersection Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-109776