Abstract
The notion of a μ-basis for an arbitrary number of polynomials in one variable is defined. The basic properties of these μ-bases are derived, and an algorithm is presented based on Gaussian Elimination to calculate a μ-basis for any collection of univariate polynomials. These μ-bases are then applied to solve implicitization, inversion and intersection problems for rational space curves. Systems where base points are present are also discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
