Compute Roots of Polynomial via Clipping Method Reporter: Lei Zhang Date: 2007/3/21.

Slides:



Advertisements
Similar presentations
Polynomial Approximation PSCI 702 October 05, 2005.
Advertisements

Lecture Notes #11 Curves and Surfaces II
Computer Graphics (Spring 2008) COMS 4160, Lecture 6: Curves 1
U-bases and Bernstein polynomials reporter: zhu ping
#8: Curves and Curved Surfaces CSE167: Computer Graphics Instructor: Ronen Barzel UCSD, Winter 2006.
Interpolation A method of constructing a function that crosses through a discrete set of known data points. .
Cubic Curves CSE167: Computer Graphics Instructor: Steve Rotenberg UCSD, Fall 2006.
Overview June 9- B-Spline Curves June 16- NURBS Curves June 30- B-Spline Surfaces.
Cubic Curves CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Winter 2005.
Jehee Lee Seoul National University
KMMCS, April. 2003, Lee Byung-Gook, Dongseo Univ., Spline Methods in CAGD Lee Byung-Gook Dongseo Univ.
Interpolation to Data Points Lizheng Lu Oct. 24, 2007.
Spline Interpretation ABC Introduction and outline Based mostly on Wikipedia.
09/04/02 Dinesh Manocha, COMP258 Bezier Curves Interpolating curve Polynomial or rational parametrization using Bernstein basis functions Use of control.
CS CS 175 – Week 8 Bézier Curves Definition, Algorithms.
1 Lecture 13 Modeling Curved Lines and Surfaces. 2 Types of Surfaces Ruled Surfaces B-Splines and Bezier Curves Surfaces of Revolution.
1 Dr. Scott Schaefer The Bernstein Basis and Bezier Curves.
Bezier and Spline Curves and Surfaces Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico.
Bspline Notes Jordan Smith UC Berkeley CS184. Outline Bézier Basis Polynomials –Linear –Quadratic –Cubic Uniform Bspline Basis Polynomials –Linear –Quadratic.
Bezier and Spline Curves and Surfaces CS4395: Computer Graphics 1 Mohan Sridharan Based on slides created by Edward Angel.
Splines III – Bézier Curves
Polynomials. 2 Content Evaluation Root finding Root Bracketing Interpolation Resultant.
KMMCS, Jan. 2006, Spline Methods in CAGD, Spline Methods in CAGD byung-gook lee Dongseo Univ.
Interactive Graphics Lecture 9: Slide 1 Interactive Graphics Lecture 9: Introduction to Spline Curves.
V. Space Curves Types of curves Explicit Implicit Parametric.
On the generalized Ball bases Speaker: Chengming Zhuang Oct.23 Advances in Computational Mathematics (2006) Jorge Delgado,Juan Manuel Peña.
1 Dr. Scott Schaefer Smooth Curves. 2/109 Smooth Curves Interpolation  Interpolation through Linear Algebra  Lagrange interpolation Bezier curves B-spline.
Review of Interpolation. A method of constructing a function that crosses through a discrete set of known data points.
Evolution-based least-squares fitting using Pythagorean hodograph spline curves Speaker: Ying.Liu November
Parent Functions AII.6. Functions At this point you should be very familiar with linear and absolute value functions. You should be able to ◦ Recognize.
1. Interpolating polynomials Polynomial of degree n,, is a linear combination of Definitions: (interval, continuous function, abscissas, and polynomial)
1 CS 430/536 Computer Graphics I Curve Drawing Algorithms Week 4, Lecture 8 David Breen, William Regli and Maxim Peysakhov Geometric and Intelligent Computing.
Nonlinear Data Discrimination via Generalized Support Vector Machines David R. Musicant and Olvi L. Mangasarian University of Wisconsin - Madison
Derivative bounds of rational Bézier curves and surfaces Hui-xia Xu Wednesday, Nov. 22, 2006.
Splines IV – B-spline Curves based on: Michael Gleicher: Curves, chapter 15 in Fundamentals of Computer Graphics, 3 rd ed. (Shirley & Marschner) Slides.
On the degree elevation of B-spline curves and corner cutting Guozhao Wang,Chongyang Deng Reporter : Jingjing Yu.
Solving polynomial equations
Keyframing and Splines Jehee Lee Seoul National University.
Representation of Curves & Surfaces Prof. Lizhuang Ma Shanghai Jiao Tong University.
UNIT 2, LESSON 1 POLYNOMIAL FUNCTIONS. WHAT IS A POLYNOMIAL FUNCTION? Coefficients must be real numbers. Exponents must be whole numbers.
Curves: ch 4 of McConnell General problem with constructing curves: how to create curves that are “smooth” CAD problem Curves could be composed of segments.
Computer Graphics (Fall 2003) COMS 4160, Lecture 10: Curves 1 Ravi Ramamoorthi
Parametric Curves CS 318 Interactive Computer Graphics John C. Hart.
Designing Parametric Cubic Curves 1. 2 Objectives Introduce types of curves ­Interpolating ­Hermite ­Bezier ­B-spline Analyze their performance.
CS 450: Computer Graphics PARAMETRIC SPLINES AND SURFACES
Specialist Mathematics Polynomials Week 3. Graphs of Cubic Polynomials.
The Factor Theorem. To factor an expression means to re-write it as a product…… 10 = 5 X 2.
Splines Sang Il Park Sejong University. Particle Motion A curve in 3-dimensional space World coordinates.
Foundations of Computer Graphics (Spring 2012) CS 184, Lecture 12: Curves 1
5. Interpolation 5.1 Definition of interpolation. 5.2 Formulas for Interpolation. 5.3 Formulas for Interpolation for unequal interval. 5.4 Applications.
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
Graphics Programming 2003, Lee Byung-Gook, Dongseo Univ., Graphics Programming Lee Byung-Gook Dongseo Univ.
CS552: Computer Graphics Lecture 19: Bezier Curves.
Evaluate the following functions with the given value.
Solving Polynomial Equations A-APR.3 Identify zeros of polynomials when suitable factorizations are available, and use the zeros to construct a rough graph.
Answers for Review Questions for Lectures 1-4. Review Lectures 1-4 Problems Question 2. Derive a closed form for the estimate of the solution of the equation.
Graphics Programming 2003, Lee Byung-Gook, Dongseo Univ., Graphics Programming Lee Byung-Gook Dongseo Univ.
Computation of the solutions of nonlinear polynomial systems
CSE 167 [Win 17], Lecture 9: Curves 1 Ravi Ramamoorthi
© University of Wisconsin, CS559 Fall 2004
Efficient Methods for Roots of Univariate Scalar Beziers
Evaluate Polynomial Functions
1. Use the quadratic formula to find all real zeros of the second-degree polynomial
The Bernstein Basis and Bezier Curves
Parent Functions.
Parametric Line equations
Families of cubic polynomial functions
SOLUTION OF NONLINEAR EQUATIONS
Parent Functions.
Overview June 9- B-Spline Curves June 16- NURBS Curves
Presentation transcript:

Compute Roots of Polynomial via Clipping Method Reporter: Lei Zhang Date: 2007/3/21

Outline History Review Bézier Clipping Quadratic Clipping Cubic Clipping Summary

Stuff Nishita, T., T. W. Sederberg, and M. Kakimoto. Ray tracing trimmed rational surface patches. Siggraph, 1990, Nishita, T., and T. W. Sederberg. Curve intersection using Bézier clipping. CAD, 1990, 22.9, Michael Barton, and Bert Juttler. Computing roots of polynomials by quadratic clipping. CAGD, in press. Lei Zhang, Ligang Liu, Bert Juttler, and Guojin Wang. Computing roots of polynomials by cubic clipping. To be submitted.

History Review Quadratic Equation  祖冲之 (429~500) 、祖日桓  花拉子米 (780~850)

Cubic Equation (Cardan formula) Tartaglia (1499~1557) Cardano (1501~1576)

Quartic Equation (Ferrari formula) Ferrari (1522~1565)

Equation  Lagrange (1736~1813)  Abel (1802~1829)  Galois (1811~1832)

Bezier Clipping Nishita, T., and T. W. Sederberg. Curve intersection using Bézier clipping. CAD, 1990, 22.9, Convex hull of control points of Bézier curve

Find the root of polynomial on the interval

Polynomial in Bézier form

Convex hull construction

The new interval

Algorithm

Convergence Rate  Single root: 2  Double root, etc: 1

Quadratic Clipping Michael Barton, and Bert Juttler. Computing roots of polynomials by quadratic clipping. CAGD, in press. Degree reduction of Bézier curve

The best quadratic approximant  (n+1) dimensional linear space of polynomials of degree n on [0, 1]  Bernstein-Bezier basis :  inner product:  is given, find quadratic polynomial such that is minimal

Degree reduction  Dual basis to the BB basis  Subspace,, Bert Juttler. The dual basis functions of the Bernstein polynomials. Advanced in Comoputational Mathematics. 1998, 8,

Degree reduction matrix  n=5, k=2

Error bound  Raising best quadratic function to degree n  Bound estimation

Bound Strip

Algorithm Convergence Rate  Quadratic clipping 3 1  Bezier clipping Single rootDouble rootTriple root

Proof of Convergence Rate

Computation effort comparison

Time cost per iteration (μs)

Numerical examples  Single roots

Double roots

Near double root

Future work  System of polynomials  Quadratic polynomial Cubic polynomial  Cubic clipping 4 2  Quadratic clipping 3 1  Bezier clipping Single rootDouble rootTriple root

Cubic Clipping

Cardano Formula Given a cubic equation

Single Roots Clone from quadratic clipping Proof

Double roots Proof

Triple roots Proof

Summary Furture Work  Quartic clipping (conjecture): cubic ->quartic polynomial singledoubletriplequadruple quartic55/25/35/4 cubic424/31 quadratic33/211 bezier2111

Thanks for your attention!